Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A103197
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A103197 Number of compositions of n into Fibonacci number of parts. +0
1
1, 2, 4, 7, 12, 21, 37, 65, 115, 208, 386, 727, 1367, 2536, 4630, 8376, 15217, 28170, 53620, 104843, 208547, 416448, 824990, 1608138, 3071813, 5747106, 10561032, 19177849, 34734782, 63495907, 118601911, 228454377, 454988025, 932297291 (list; graph; listen)
OFFSET

1,2

FORMULA

a(n) = Sum_{k=0..n} binomial(n-1, k-1)*A010056(k).

a(n) = Sum_{k>1} (x/(1-x))^Fibonacci(k).

CROSSREFS

Cf. A102848, A052467.

Sequence in context: A100671 A005251 A014167 this_sequence A000709 A054161 A023433

Adjacent sequences: A103194 A103195 A103196 this_sequence A103198 A103199 A103200

KEYWORD

easy,nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)Eunet.yu), Mar 18 2005

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research