id:A066628 - OEIS Search Results

Search: id:A066628

Displaying 1-1 of 1 results found.

page 1

a(n) = n - the largest Fibonacci number <= n.

+0
1

0, 0, 0, 0, 1, 0, 1, 2, 0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30 (list; graph; listen)

	OFFSET	`0,8`
	MATHEMATICA	`f[n_] := Block[{k = 1}, While[Fibonacci[k] <= n, k++ ]; Return[n - Fibonacci[k - 1]]]; Table[ f[n], {n, 0, 100} ]`
	CROSSREFS	`Cf. A000045.` `Sequence in context: A107017 A049260 A053186 this_sequence A135317 A115218 A023858` `Adjacent sequences: A066625 A066626 A066627 this_sequence A066629 A066630 A066631`
	KEYWORD	`nonn`
	AUTHOR	`Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Dec 25 2001`
	EXTENSIONS	`Corrected and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Dec 28 2001`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research