login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A107259 Number of ways to represent n as Fibonacci(i) + triangular(j), i,j>=0. 2
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

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

CROSSREFS

Cf. A107258.

Sequence in context: A329601 A230578 A089132 * A121041 A157439 A261865

Adjacent sequences:  A107256 A107257 A107258 * A107260 A107261 A107262

KEYWORD

nonn

AUTHOR

Ralf Stephan, May 15 2005

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 January 22 20:00 EST 2022. Contains 350504 sequences. (Running on oeis4.)