login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A161275 Number of partitions of n into Lucas numbers A000032 where every part appears at least 9 times 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; refs; listen; history; internal format)
OFFSET

1,18

LINKS

R. H. Hardin, Table of n, a(n) for n=1..1000

CROSSREFS

Sequence in context: A161033 A161084 A161300 * A160979 A167679 A051881

Adjacent sequences:  A161272 A161273 A161274 * A161276 A161277 A161278

KEYWORD

nonn

AUTHOR

R. H. Hardin (rhhardin(AT)att.net) Jun 06 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 05:53 EST 2012. Contains 205570 sequences.