A107259 Number of ways to represent n as Fibonacci(i) + triangular(j), i,j>=0.

1, 2, 2, 3, 2, 2, 3, 1, 3, 2, 1, 3, 1, 2, 2, 2, 2, 1, 2, 1, 1, 2, 2, 3, 2, 0, 1, 1, 2, 2, 1, 2, 0, 1, 2, 1, 3, 2, 1, 1, 1, 2, 1, 0, 2, 1, 1, 1, 1, 3, 1, 0, 0, 1, 0, 3, 2, 2, 3, 0, 1, 1, 1, 1, 0, 1, 2, 1, 2, 1, 2, 1, 0, 0, 1, 0, 2, 0, 1, 3, 1, 1, 0, 2, 0, 0, 1, 1, 0, 2, 1, 3, 2, 1, 1, 1, 1, 0, 0, 3, 2, 0

Offset

0,2

Links

Table of n, a(n) for n=0..101.

Crossrefs

Cf. A107258.

Sequence in context: A230578 A362663 A089132 * A121041 A157439 A261865

Adjacent sequences: A107256 A107257 A107258 * A107260 A107261 A107262

Keyword

nonn

Author

Ralf Stephan, May 15 2005

Status

approved