The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A120510 Generalized meta-Fibonacci sequence a(n) with parameters s=3 and k=4. 2
1, 1, 1, 1, 2, 3, 4, 4, 4, 4, 4, 5, 6, 7, 8, 8, 9, 10, 11, 12, 12, 13, 14, 15, 16, 16, 16, 16, 16, 16, 17, 18, 19, 20, 20, 21, 22, 23, 24, 24, 25, 26, 27, 28, 28, 29, 30, 31, 32, 32, 32, 33, 34, 35, 36, 36, 37, 38, 39, 40 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
LINKS
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]
FORMULA
If 1 <= n <= 4, a(n)=1. If 5 <= n <= 7, then a(n)=n-3. If n>7 then a(n)=a(n-3-a(n-1)) + a(n-4-a(n-2)) + a(n-5-a(n-3)) + a(n-6-a(n-4)).
G.f.: A(z) = z * (1 - z^3) / (1 - z) * sum(prod(z^3 * (1 - z^(4 * [i])) / (1 - z^[i]), i=1..n), n=0..infinity), where [i] = (4^i - 1) / 3.
MAPLE
a := proc(n)
option remember;
if n <= 4 then return 1 end if;
if n <= 7 then return n-3 end if;
return add(a(n - i - 2 - a(n - i)), i = 1 .. 4)
end proc
CROSSREFS
Sequence in context: A369149 A131754 A287422 * A029117 A308547 A195850
KEYWORD
nonn
AUTHOR
Frank Ruskey and Chris Deugau (deugaucj(AT)uvic.ca), Jun 20 2006
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 13 21:51 EDT 2024. Contains 372523 sequences. (Running on oeis4.)