Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A120513
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A120513 a(n) = min{j : A120502(j) = n}. +0
3
1, 5, 10, 11, 17, 18, 20, 21, 28, 29, 31, 32, 35, 36, 38, 39, 47, 48, 50, 51, 54, 55, 57, 58, 62, 63, 65, 66, 69, 70, 72, 73, 82, 83, 85, 86, 89, 90, 92, 93, 97, 98, 100, 101, 104, 105, 107, 108, 113, 114 (list; graph; listen)
OFFSET

1,2

REFERENCES

B. Jackson and F. Ruskey, Meta-Fibonacci Sequences, Binary Trees and Extremal Compact Codes, Electronic Journal of Combinatorics, 13 (2006), #R26, 13 pages.

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^2) * (3 + 1 / (1 - z^(m^2))), 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 A120502(j) = n then return j; fi; od;

end proc;

CROSSREFS

Cf. A120502, A120524.

Sequence in context: A136825 A136824 A136822 this_sequence A004757 A007527 A033894

Adjacent sequences: A120510 A120511 A120512 this_sequence A120514 A120515 A120516

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 | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research