Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A161269
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A161269 Number of partitions of n into Lucas numbers A000032 where every part appears at least 3 times +0
1
0, 0, 0, 0, 0, 2, 1, 2, 3, 3, 3, 7, 5, 6, 10, 10, 10, 15, 14, 18, 23, 23, 25, 36, 35, 40, 49, 54, 57, 70, 74, 84, 99, 105, 114, 137, 144, 159, 181, 198, 214, 243, 261, 287, 322, 345, 375, 422, 451, 489, 538, 583, 629, 693, 741, 804, 878, 940, 1015, 1107, 1183, 1272, 1377, 1478, 1584 (list; graph; listen)
OFFSET

1,6

LINKS

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

CROSSREFS

Sequence in context: A161027 A161078 A161294 this_sequence A100405 A081366 A129636

Adjacent sequences: A161266 A161267 A161268 this_sequence A161270 A161271 A161272

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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research