id:A121549 - OEIS Search Results

Search: id:A121549

Displaying 1-1 of 1 results found.

page 1

Number of ordered ways of writing n as a sum of two Fibonacci numbers (only one 1 is considered as a Fibonacci number).

+0
3

0, 1, 2, 3, 2, 3, 2, 2, 2, 3, 2, 0, 2, 2, 2, 3, 0, 2, 0, 0, 2, 2, 2, 2, 0, 3, 0, 0, 2, 0, 0, 0, 0, 2, 2, 2, 2, 0, 2, 0, 0, 3, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 0, 2, 0, 0, 2, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 0, 2, 0, 0, 2, 0, 0, 0, 0, 2, 0, 0, 0 (list; graph; listen)

	OFFSET	`1,3`
	COMMENT	`a(n)=A121548(n,2).`
	FORMULA	`G.f.=sum(z^fibonacci(i), i = 2..infinity)^2.`
	EXAMPLE	`a(6)=3 because we have 6=1+5=3+3=5+1.`
	MAPLE	`with(combinat): g:=sum(z^fibonacci(i), i=2..30)^2: gser:=series(g, z=0, 130): seq(coeff(gser, z, n), n=1..126);`
	CROSSREFS	`Cf. A000045, A121548, A121550.` `Sequence in context: A125928 A114388 A075789 this_sequence A023397 A066102 A036048` `Adjacent sequences: A121546 A121547 A121548 this_sequence A121550 A121551 A121552`
	KEYWORD	`nonn`
	AUTHOR	`Emeric Deutsch (deutsch(AT)duke.poly.edu), Aug 07 2006`

page 1

Search completed in 0.002 seconds

Last modified November 24 14:25 EST 2009. Contains 167438 sequences.

AT&T Labs Research