A330440 - OEIS

%I #16 Jun 01 2022 09:05:45

%S 0,1,2,4,5,8,11,14,22,28,32,42,45,48,68,71,77,89,92,95,108,115,140,

%T 149,194,216,254,257,260,263,268,277,295,298,310,340,346,362,365,424,

%U 431,462,476,479,486,539,560,576,579,657,692,707,754,757,794,797,928

%N Numbers k such that A316774(k) != A316774(j) for all 0 <= j < k.

%C This is a sorted version of A316905.

%C List of indices k such that A330439(k) = 1.

%H Alois P. Heinz, <a href="/A330440/b330440.txt">Table of n, a(n) for n = 1..25000</a>

%F { k >= 0 : A330439(k) = 1 }.

%p b:= proc() 0 end:

%p g:= proc(n) option remember; local t;

%p       t:= `if`(n<2, n, b(g(n-1))+b(g(n-2)));

%p       b(t):= b(t)+1; t

%p     end:

%p f:= proc(n) option remember; b(g(n)) end:

%p a:= proc(n) option remember; local k; for k from 1+

%p       `if`(n=1, -1, a(n-1)) while f(k)<>1 do od; k

%p     end:

%p seq(a(n), n=1..80);

%t b[_] = 0;

%t g[n_] := g[n] = Module[{t},

%t      t = If[n < 2, n, b[g[n - 1]] + b[g[n - 2]]];

%t      b[t]++; t];

%t f[n_] := f[n] = b[g[n]];

%t a[n_] := a[n] = Module[{k}, For[k = 1 +

%t      If[n == 1, -1, a[n - 1]], f[k] != 1, k++]; k];

%t Table[a[n], {n, 1, 80}] (* _Jean-François Alcover_, Jun 01 2022, after _Alois P. Heinz_ *)

%Y Cf. A316774, A316905, A330439.

%Y Column k=1 of A330587.

%K nonn

%O 1,3

%A _Alois P. Heinz_, Dec 14 2019