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!)
A120518 a(n) = min{j : A120507(j) = n}. 2
1, 2, 3, 4, 6, 7, 8, 9, 11, 12, 13, 14, 16, 17, 18, 19, 22, 23, 24, 25, 27, 28, 29, 30, 32, 33, 34, 35, 37, 38, 39, 40, 43, 44, 45, 46, 48, 49, 50, 51, 53, 54, 55, 56, 58, 59, 60, 61, 64, 65 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
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
G.f.: z / (1-z) * (1 + sum(z^(m^4) * (1 / (1 - z^(m^4))), m=0..infinity)).
a(1) = 1; a(n) = n-1 + a(floor((n-1)/4)+1). - Gleb Ivanov, Jan 12 2022
MAPLE
p := proc(n)
if n=1 then return 1; end if;
for j from p(n-1)+1 to infinity do
if A120507(j) = n then return j; fi; od;
end proc;
CROSSREFS
Sequence in context: A261189 A023721 A087066 * A101888 A190241 A225859
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 8 19:26 EDT 2024. Contains 372341 sequences. (Running on oeis4.)