cp's OEIS Frontend

A330439 Number of times g(n) appears in [g(0),g(1),...,g(n)], where g = A316774.

%I A330439 #14 Mar 30 2021 07:45:52
%S A330439 1,1,1,2,1,1,3,2,1,2,3,1,3,4,1,2,4,2,3,4,2,5,1,6,2,3,3,7,1,4,4,5,1,8,
%T A330439 2,2,5,3,6,3,4,7,1,8,5,1,9,3,1,6,4,4,9,2,2,7,6,3,7,5,2,5,6,3,8,3,4,10,
%U A330439 1,5,10,1,6,7,4,7,8,1,9,6,2,11,5,2,8,7,3,8,9,1,9,10,1,10,11,1,4,5,10,4,2,11,6
%N A330439 Number of times g(n) appears in [g(0),g(1),...,g(n)], where g = A316774.
%H A330439 Alois P. Heinz, <a href="/A330439/b330439.txt">Table of n, a(n) for n = 0..65536</a>
%p A330439 b:= proc() 0 end:
%p A330439 g:= proc(n) option remember; local t;
%p A330439       t:= `if`(n<2, n, b(g(n-1))+b(g(n-2)));
%p A330439       b(t):= b(t)+1; t
%p A330439     end:
%p A330439 a:= proc(n) option remember; b(g(n)) end:
%p A330439 seq(a(n), n=0..200);
%t A330439 b[_] = 0;
%t A330439 g[n_] := g[n] = Module[{t},
%t A330439      t = If[n<2, n, b[g[n-1]]+b[g[n-2]]];
%t A330439      b[t]++; t];
%t A330439 a[n_] := a[n] = b[g[n]];
%t A330439 a /@ Range[0, 200] (* _Jean-François Alcover_, Mar 30 2021, after _Alois P. Heinz_ *)
%Y A330439 Cf. A316774, A330440.
%K A330439 nonn,look
%O A330439 0,4
%A A330439 _Alois P. Heinz_, Dec 14 2019