login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A121549 Number of ordered ways of writing n as a sum of two Fibonacci numbers (only one 1 is considered as a Fibonacci number). 2
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; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

a(n)=A121548(n,2).

LINKS

Table of n, a(n) for n=1..105.

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: A321865 A244544 A159580 * A244228 A023397 A258115

Adjacent sequences:  A121546 A121547 A121548 * A121550 A121551 A121552

KEYWORD

nonn

AUTHOR

Emeric Deutsch, Aug 07 2006

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 20 02:06 EDT 2019. Contains 322291 sequences. (Running on oeis4.)