cp's OEIS Frontend

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

%I A330440 #16 Jun 01 2022 09:05:45
%S A330440 0,1,2,4,5,8,11,14,22,28,32,42,45,48,68,71,77,89,92,95,108,115,140,
%T A330440 149,194,216,254,257,260,263,268,277,295,298,310,340,346,362,365,424,
%U A330440 431,462,476,479,486,539,560,576,579,657,692,707,754,757,794,797,928
%N A330440 Numbers k such that A316774(k) != A316774(j) for all 0 <= j < k.
%C A330440 This is a sorted version of A316905.
%C A330440 List of indices k such that A330439(k) = 1.
%H A330440 Alois P. Heinz, <a href="/A330440/b330440.txt">Table of n, a(n) for n = 1..25000</a>
%F A330440 { k >= 0 : A330439(k) = 1 }.
%p A330440 b:= proc() 0 end:
%p A330440 g:= proc(n) option remember; local t;
%p A330440       t:= `if`(n<2, n, b(g(n-1))+b(g(n-2)));
%p A330440       b(t):= b(t)+1; t
%p A330440     end:
%p A330440 f:= proc(n) option remember; b(g(n)) end:
%p A330440 a:= proc(n) option remember; local k; for k from 1+
%p A330440       `if`(n=1, -1, a(n-1)) while f(k)<>1 do od; k
%p A330440     end:
%p A330440 seq(a(n), n=1..80);
%t A330440 b[_] = 0;
%t A330440 g[n_] := g[n] = Module[{t},
%t A330440      t = If[n < 2, n, b[g[n - 1]] + b[g[n - 2]]];
%t A330440      b[t]++; t];
%t A330440 f[n_] := f[n] = b[g[n]];
%t A330440 a[n_] := a[n] = Module[{k}, For[k = 1 +
%t A330440      If[n == 1, -1, a[n - 1]], f[k] != 1, k++]; k];
%t A330440 Table[a[n], {n, 1, 80}] (* _Jean-François Alcover_, Jun 01 2022, after _Alois P. Heinz_ *)
%Y A330440 Cf. A316774, A316905, A330439.
%Y A330440 Column k=1 of A330587.
%K A330440 nonn
%O A330440 1,3
%A A330440 _Alois P. Heinz_, Dec 14 2019