login
A330448
a(n) = A330447(n) - A316905(n).
3
0, 0, 0, 0, 1, 0, 0, 0, 8, 0, 4, 0, 0, 3, 0, 0, 0, 0, 0, 0, 23, 0, 45, 0, 0, 0, 74, 8, 0, 56, 47, 0, 0, 105, 67, 85, 64, 0, 130, 45, 111, 0, 21, 136, 74, 98, 0, 97, 0, 0, 35, 0, 0, 0, 37, 0, 0, 0, 52, 0, 104, 52, 67, 0, 0, 70, 0, 0, 0, 0, 0, 152, 0, 0, 0, 0, 0
OFFSET
0,9
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:
f:= proc() local t, a; t, a:= -1, proc() -1 end;
proc(n) local h;
while a(n) = -1 do
t:= t+1; h:= g(t);
if a(h) = -1 then a(h):= t fi
od; a(n)
end
end():
h:= proc(n) option remember; `if`(n<0, 0,
max(h(n-1), f(n)))
end:
a:= n-> h(n)-f(n):
seq(a(n), n=0..100);
MATHEMATICA
b[_] = 0;
g[n_] := g[n] = Module[{t}, t = If[n < 2, n, b[g[n - 1]] + b[g[n - 2]]]; b[t] = b[t] + 1; t];
f[n_] := Module[{t, a}, t = -1; a[_] = -1; Module[{h}, While[a[n] == -1, t = t + 1; h = g[t]; If[a[h] == -1, a[h] = t]]; a[n]]];
h[n_] := h[n] = If[n < 0, 0, Max[h[n - 1], f[n]]];
a[n_] := h[n] - f[n];
Table[a[n], {n, 0, 100}] (* Jean-François Alcover, Nov 13 2023, after Alois P. Heinz *)
CROSSREFS
KEYWORD
nonn,look
AUTHOR
Alois P. Heinz, Dec 15 2019
STATUS
approved