Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A161103
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A161103 Number of partitions of n into nonzero triangular numbers where every part appears at least 2 times +0
1
0, 1, 1, 1, 1, 2, 1, 2, 3, 2, 3, 5, 3, 5, 6, 5, 6, 9, 6, 10, 11, 10, 12, 16, 12, 17, 19, 17, 21, 27, 21, 30, 32, 30, 35, 42, 35, 46, 50, 47, 55, 66, 56, 72, 77, 73, 84, 97, 86, 107, 114, 110, 125, 143, 128, 156, 165, 160, 181, 204, 186, 224, 236, 230, 259, 285, 266, 312, 329, 322 (list; graph; listen)
OFFSET

1,6

LINKS

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

CROSSREFS

Sequence in context: A165477 A119994 A029167 this_sequence A147301 A108380 A112779

Adjacent sequences: A161100 A161101 A161102 this_sequence A161104 A161105 A161106

KEYWORD

nonn

AUTHOR

Ron Hardin (rhhardin(AT)att.net) Jun 02 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 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research