id:A116543 - OEIS Search Results

Search: id:A116543

Displaying 1-1 of 1 results found.

page 1

Number of terms in greedy representation of n of the Lucas numbers.

+0
2

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

	OFFSET	`1,5`
	COMMENT	`I have been researching A007895 and similar sequences and created this sequence as an analogue of A007895 for the Lucas sequence (A000032).`
	LINKS	`Ron Knott, Using the Fibonacci numbers to represent whole numbers.`
	FORMULA	`Let L(N)=max(Lucas numbers < N). Then a(0)=0 a(N)=1+a(N-L(N)).`
	EXAMPLE	`a(12)=2 because 12=11+1`
	CROSSREFS	`Cf. A131343, A000032, A007895.` `Sequence in context: A105697 A080757 A037196 this_sequence A107260 A116204 A159905` `Adjacent sequences: A116540 A116541 A116542 this_sequence A116544 A116545 A116546`
	KEYWORD	`nonn`
	AUTHOR	`James Davis (math-man(AT)tamu.edu), Mar 28 2006, Jun 07 2006`
	EXTENSIONS	`Edited by N. J. A. Sloane (njas(AT)research.att.com), Aug 10 2007`

page 1

Search completed in 0.002 seconds

Last modified December 7 08:40 EST 2009. Contains 170430 sequences.

AT&T Labs Research