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”).
proposed
approved
editing
proposed
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 *)
approved
editing
editing
approved
Alois P. Heinz, <a href="/A330588/b330588.txt">Table of n, a(n) for n = 1..16000</a>
Aa:= proc() local l, t; t, l:= -1, proc() [] -1 end;
proc(n, k) local h;
while nops(l(k))<n 0 do t:= t+1; h:= f(t);
h:= f(t); if l(h):= [<0 then l(h)[], := t] fi
od: l(k)[n]
a:= n-> A(1, n):
A(1,n)
a(n) is the first index m such that A330439(m) = n.
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() [] end;
proc(n, k) local h;
while nops(l(k))<n do t:= t+1;
h:= f(t); l(h):= [l(h)[], t]
od: l(k)[n]
end
end():
a:= n-> A(1, n):
seq(a(n), n=1..60);
Row n=1 of A330587.