Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A039853
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A039853 Number of partitions satisfying cn(0,5) + cn(2,5) + cn(3,5) <= 1. +0
1
1, 2, 3, 4, 5, 7, 9, 12, 15, 18, 23, 29, 35, 43, 51, 62, 74, 89, 105, 124, 146, 172, 201, 235, 272, 316, 366, 423, 486, 559, 640, 734, 838, 955, 1086, 1235, 1400, 1587, 1793, 2025, 2282, 2572, 2891, 3248, 3642 (list; graph; listen)
OFFSET

1,2

COMMENT

For a given partition cn(i,n) means the number of its parts equal to i modulo n.

Short: 0 + 2 + 3 <= u (ZBBpU).

CROSSREFS

Adjacent sequences: A039850 A039851 A039852 this_sequence A039854 A039855 A039856

Sequence in context: A039850 A033100 A030741 this_sequence A062188 A122129 A003413

KEYWORD

nonn

AUTHOR

Olivier Gerard (olivier.gerard(AT)gmail.com)

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 October 5 16:50 EDT 2008. Contains 144613 sequences.


AT&T Labs Research