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!)
A120521 a(n) = min{j : A120510(j) = n}. 2
1, 5, 6, 7, 12, 13, 14, 15, 17, 18, 19, 20, 22, 23, 24, 25, 31, 32, 33, 34, 36, 37, 38, 39, 41, 42, 43, 44, 46, 47, 48, 49, 52, 53, 54, 55, 57, 58, 59, 60, 62, 63, 64, 65, 67, 68, 69, 70, 73, 74 (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^4) * (3 + 1 / (1 - z^(m^4))), 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 A120510(j) = n then return j; fi; od;

end proc;

CROSSREFS

Cf. A120510, A120532.

Sequence in context: A028318 A154952 A037360 * A022566 A047320 A327301

Adjacent sequences:  A120518 A120519 A120520 * A120522 A120523 A120524

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 January 26 11:23 EST 2020. Contains 331279 sequences. (Running on oeis4.)