login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A120516 a(n) = min{j : A120505(j) = n}. 2
1, 4, 5, 9, 10, 11, 13, 14, 15, 20, 21, 22, 24, 25, 26, 28, 29, 30, 33, 34, 35, 37, 38, 39, 41, 42, 43, 49, 50, 51, 53, 54, 55, 57, 58, 59, 62, 63, 64, 66, 67, 68, 70, 71, 72, 75, 76, 77, 79, 80 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..50.

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

g.f.: P(z) = z / (1-z) * (1 + sum(z^(m^3) * (2 + 1 / (1 - z^(m^3))), m=0..infinity))

MAPLE

p := proc(n)

if n=1 then return 1; end if;

for j from p(n-1)+1 to infinity do

if A120505(j) = n then return j; fi; od;

end proc;

CROSSREFS

Cf. A120505, A120527.

Sequence in context: A243591 A189012 A030415 * A189136 A116026 A115915

Adjacent sequences:  A120513 A120514 A120515 * A120517 A120518 A120519

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 7 15:30 EDT 2020. Contains 336276 sequences. (Running on oeis4.)