OFFSET
1,3
LINKS
Paolo Xausa, Table of n, a(n) for n = 1..10000
C. Deugau and F. Ruskey, Complete k-ary Trees and Generalized Meta-Fibonacci Sequences, J. Integer Seq., Vol. 12. [This is a later version than that in the GenMetaFib.html link]
C. Deugau and F. Ruskey, Complete k-ary Trees and Generalized Meta-Fibonacci Sequences.
FORMULA
If 1 <= n <= 2, a(n) = 1. If 3 <= n <= 4, then a(n) = n-1. If n > 4 then a(n) = a(n-1-a(n-1)) + a(n-2-a(n-2)) + a(n-3-a(n-3)).
G.f.: A(z) = z * sum(prod(z * (1 - z^(3 * [i])) / (1 - z^[i]), i=1..n), n=0..infinity), where [i] = (3^i - 1) / 2.
MAPLE
a := proc(n)
option remember;
if n <= 2 then return 1 end if;
if n <= 4 then return n-1 end if;
return add(a(n - i - a(n - i)), i = 1 .. 3)
end proc;
MATHEMATICA
CROSSREFS
KEYWORD
nonn
AUTHOR
Frank Ruskey and Chris Deugau (deugaucj(AT)uvic.ca), Jun 20 2006
EXTENSIONS
More terms from Paolo Xausa, Mar 26 2026
STATUS
approved
