Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A161256
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A161256 Number of partitions of n into central polygonal numbers A000124 where every part appears at least 3 times +0
1
0, 0, 1, 1, 1, 2, 1, 2, 2, 3, 3, 5, 4, 5, 6, 8, 7, 9, 9, 12, 12, 14, 14, 19, 18, 22, 23, 28, 27, 32, 34, 40, 42, 47, 48, 57, 58, 66, 69, 78, 81, 89, 94, 106, 111, 120, 128, 143, 148, 161, 170, 187, 196, 214, 225, 244, 257, 277, 294, 319, 335, 357, 377, 409, 428, 460, 483, 519, 546, 582 (list; graph; listen)
OFFSET

1,6

LINKS

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

CROSSREFS

Sequence in context: A161228 A029172 A161052 this_sequence A161281 A003113 A152227

Adjacent sequences: A161253 A161254 A161255 this_sequence A161257 A161258 A161259

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 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research