id:A107259 - OEIS Search Results

Search: id:A107259

Displaying 1-1 of 1 results found.

page 1

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

+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; listen)

	OFFSET	`0,2`
	CROSSREFS	`Cf. A107258.` `Sequence in context: A067132 A151613 A089132 this_sequence A121041 A157439 A003589` `Adjacent sequences: A107256 A107257 A107258 this_sequence A107260 A107261 A107262`
	KEYWORD	`nonn`
	AUTHOR	`Ralf Stephan (ralf(AT)ark.in-berlin.de), May 15 2005`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research