id:A058978 - OEIS Search Results

Search: id:A058978

Displaying 1-1 of 1 results found.

page 1

Minimal number of (non-consecutive) Fibonacci numbers needed to get n by addition and subtraction.

+0
1

1, 1, 1, 2, 1, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 2, 3, 2, 2, 2, 1, 2, 2, 2, 3, 2, 3, 3, 2, 3, 2, 2, 2, 1, 2, 2, 2, 3, 2, 3, 3, 2, 3, 3, 3, 3, 2, 3, 3, 3, 3, 2, 2, 2, 1, 2, 2, 2, 3, 2, 3, 3, 2, 3, 3, 3, 3, 2, 3, 3, 3, 4, 3, 3, 3, 2 (list; graph; listen)

	OFFSET	`1,4`
	CROSSREFS	`Cf. A007895.` `Sequence in context: A114284 A023575 A105446 this_sequence A118916 A107800 A085761` `Adjacent sequences: A058975 A058976 A058977 this_sequence A058979 A058980 A058981`
	KEYWORD	`nonn`
	AUTHOR	`Floor van Lamoen (fvlamoen(AT)hotmail.com), Jan 15 2001`

page 1

Search completed in 0.002 seconds

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.

AT&T Labs Research