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

Author

Ralf Stephan, May 15 2005

Keywords

• nonn

Crossrefs

Cf. A107258.