Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A120518
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A120518 a(n) = min{j : A120507(j) = n}. +0
3
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; listen)
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]

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) * (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 A120507(j) = n then return j; fi; od;

end proc;

CROSSREFS

Cf. A120507, A120529.

Sequence in context: A047201 A023721 A087066 this_sequence A101888 A020655 A031942

Adjacent sequences: A120515 A120516 A120517 this_sequence A120519 A120520 A120521

KEYWORD

nonn

AUTHOR

Frank Ruskey (http://www.cs.uvic.ca/~ruskey/) and Chris Deugau (deugaucj(AT)uvic.ca), Jun 20 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 20 09:10 EDT 2010. Contains 173642 sequences.


AT&T Labs Research