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

%I

%S 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,

%T 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,

%U 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

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

%Y Cf. A107258.

%K nonn

%O 0,2

%A _Ralf Stephan_, May 15 2005

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 26 07:29 EDT 2022. Contains 354077 sequences. (Running on oeis4.)