Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A161271
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A161271 Number of partitions of n into Lucas numbers A000032 where every part appears at least 5 times +0
1
0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 1, 2, 1, 2, 3, 3, 3, 5, 4, 7, 7, 7, 8, 11, 11, 12, 14, 15, 16, 20, 19, 23, 25, 28, 31, 36, 36, 43, 46, 53, 56, 66, 67, 77, 83, 90, 98, 109, 115, 128, 136, 149, 159, 176, 187, 206, 218, 236, 254, 278, 293, 321, 342, 367, 393, 425, 450, 485, 518, 556, 592, 635, 675, 723, 770 (list; graph; listen)
OFFSET

1,10

LINKS

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

CROSSREFS

Sequence in context: A161029 A161080 A161296 this_sequence A160975 A049711 A137293

Adjacent sequences: A161268 A161269 A161270 this_sequence A161272 A161273 A161274

KEYWORD

nonn

AUTHOR

Ron Hardin (rhhardin(AT)att.net) Jun 06 2009

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 1 13:27 EST 2009. Contains 167806 sequences.


AT&T Labs Research