id:A003263 - OEIS Search Results

Search: id:A003263

Displaying 1-1 of 1 results found.

page 1

Number of representations of n as a sum of distinct Lucas numbers 1,3,4,7,11 ... (A000204).
(Formerly M0045)

+0
5

1, 0, 1, 2, 1, 0, 2, 2, 0, 1, 3, 2, 0, 2, 3, 1, 0, 3, 3, 0, 2, 4, 2, 0, 3, 3, 0, 1, 4, 3, 0, 3, 5, 2, 0, 4, 4, 0, 2, 5, 3, 0, 3, 4, 1, 0, 4, 4, 0, 3, 6, 3, 0, 5, 5, 0, 2, 6, 4, 0, 4, 6, 2, 0, 5, 5, 0, 3, 6, 3, 0, 4, 4, 0, 1, 5, 4, 0, 4, 7, 3, 0, 6, 6, 0, 3, 8, 5, 0, 5, 7, 2, 0, 6, 6, 0, 4, 8, 4, 0, 6, 6, 0, 2, 7 (list; graph; listen)

	OFFSET	`1,4`
	REFERENCES	`A. Brousseau, Fibonacci and Related Number Theoretic Tables. Fibonacci Association, San Jose, CA, 1972, p. 58.`
	LINKS	`T. D. Noe, Table of n, a(n) for n = 0..9349`
	CROSSREFS	`Cf. A054770, A000204.` `Sequence in context: A000925 A003985 A065676 this_sequence A135211 A029294 A065434` `Adjacent sequences: A003260 A003261 A003262 this_sequence A003264 A003265 A003266`
	KEYWORD	`nonn,easy`
	AUTHOR	`njas`
	EXTENSIONS	`More terms from James A. Sellers (sellersj(AT)math.psu.edu), May 29 2000`

page 1

Search completed in 0.002 seconds

Last modified July 24 12:00 EDT 2008. Contains 142294 sequences.

AT&T Labs Research