|
|
A330439
|
|
Number of times g(n) appears in [g(0),g(1),...,g(n)], where g = A316774.
|
|
6
|
|
|
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, 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, 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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,4
|
|
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:
a:= proc(n) option remember; b(g(n)) end:
seq(a(n), n=0..200);
|
|
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];
a[n_] := a[n] = b[g[n]];
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|