id:A161275 - OEIS Search Results

Search: id:A161275

Displaying 1-1 of 1 results found.

page 1

Number of partitions of n into Lucas numbers A000032 where every part appears at least 9 times

+0
1

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 1, 2, 1, 2, 1, 2, 1, 2, 3, 3, 3, 5, 4, 5, 6, 6, 6, 10, 8, 9, 11, 12, 11, 14, 13, 15, 18, 17, 18, 22, 21, 22, 25, 25, 26, 31, 29, 33, 36, 38, 38, 46, 44, 50, 55, 58, 59, 70, 69, 77, 82, 90, 91, 106, 106, 117, 124, 134, 138, 154, 157, 171, 181, 192, 199, 219, 223, 239, 252, 267, 275 (list; graph; listen)

	OFFSET	`1,18`
	LINKS	`Ron Hardin, Table of n, a(n) for n=1..1000`
	CROSSREFS	`Sequence in context: A161033 A161084 A161300 this_sequence A160979 A167679 A051881` `Adjacent sequences: A161272 A161273 A161274 this_sequence A161276 A161277 A161278`
	KEYWORD	`nonn`
	AUTHOR	`Ron Hardin (rhhardin(AT)att.net) Jun 06 2009`

page 1

Search completed in 0.002 seconds

Last modified December 17 23:40 EST 2009. Contains 171025 sequences.

AT&T Labs Research