id:A083853 - OEIS Search Results

Search: id:A083853

Displaying 1-1 of 1 results found.

page 1

Smallest nonnegative integer that can be written as a sum of Fibonacci numbers in n ways, counting 1 twice as Fibonacci number.

+0
3

0, 1, 3, 6, 9, 14, 22, 24, 37, 40, 58, 61, 64, 95, 98, 103, 155, 153, 166, 171, 168, 247, 386, 257, 276, 273, 407, 404, 401, 417, 443, 438, 647, 441, 653, 650, 1011, 705, 674, 708, 1045, 713, 1053, 1048, 1085, 1142, 1051, 1090, 1140, 1153, 1723, 1158, 2661, 1702, 1155, 1710 (list; graph; listen)

	OFFSET	`1,3`
	FORMULA	`A000121(a(n)) = n.`
	CROSSREFS	`Least inverse of A000121. Cf. A013583.` `Sequence in context: A130473 A082643 A135524 this_sequence A058597 A146562 A133331` `Adjacent sequences: A083850 A083851 A083852 this_sequence A083854 A083855 A083856`
	KEYWORD	`nonn`
	AUTHOR	`R. K. Guy and David W. Wilson, Jun 19 2003`

page 1

Search completed in 0.002 seconds

Last modified November 25 08:46 EST 2009. Contains 167481 sequences.

AT&T Labs Research