Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A134041
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A134041 a(n) = number of binary partitions of the Fibonacci number F(n). +0
1
1, 2, 2, 4, 6, 14, 36, 114, 450, 2268, 14442, 118686, 1264678, 17519842, 318273566, 7607402556, 240151303078, 10055927801538, 559859566727028, 41582482495661986, 4129785050606801246, 549628445573614296188 (list; graph; listen)
OFFSET

0,2

FORMULA

a(n) = A000123( A000045(n) ) for n>=0.

CROSSREFS

Cf. A000123, A000045.

Sequence in context: A061894 A116684 A116637 this_sequence A069925 A080611 A072707

Adjacent sequences: A134038 A134039 A134040 this_sequence A134042 A134043 A134044

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Oct 02 2007

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 4 21:35 EST 2008. Contains 151309 sequences.


AT&T Labs Research