[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A330588
a(n) is the first index m such that A330439(m) = n.
2
0, 3, 6, 13, 21, 23, 27, 33, 46, 67, 81, 104, 107, 114, 129, 166, 169, 172, 193, 261, 267, 276, 287, 311, 373, 430, 457, 478, 485, 590, 596, 656, 691, 768, 789, 796, 873, 941, 969, 1047, 1093, 1149, 1170, 1239, 1303, 1349, 1491, 1533, 1555, 1567, 1805, 1808
OFFSET
1,2
LINKS
MAPLE
b:= proc() 0 end:
g:= proc(n) option remember; local t;
t:= `if`(n<2, n, b(g(n-1))+b(g(n-2)));
b(t):= b(t)+1; t
end:
f:= proc(n) option remember; b(g(n)) end:
a:= proc() local l, t; t, l:= -1, proc() -1 end;
proc(k) local h;
while l(k)<0 do t:= t+1; h:= f(t);
if l(h)<0 then l(h):= t fi
od: l(k)
end
end():
seq(a(n), n=1..60);
MATHEMATICA
b[_] = 0;
g[n_] := g[n] = Module[{t}, t = If[n < 2, n, b[g[n-1]] + b[g[n-2]]]; b[t]++; t];
f[n_] := f[n] = b[g[n]];
A[n_, k_] := Module[{l, t = -1, h}, l[_] = {}; While[Length[l[k]] < n, t++; h = f[t]; AppendTo[l[h], t]]; l[k][[n]]];
a[k_] := A[1, k];
Table[a[n], {n, 1, 60}] (* Jean-François Alcover, Dec 13 2023, after Alois P. Heinz *)
CROSSREFS
Row n=1 of A330587.
Sequence in context: A318228 A064290 A064621 * A194279 A293822 A371917
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Dec 18 2019
STATUS
approved