Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A039875
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A039875 Number of partitions satisfying cn(2,5) <= cn(0,5) + cn(3,5) and cn(2,5) <= cn(0,5) + cn(4,5) and cn(3,5) <= cn(0,5) + cn(1,5) and cn(3,5) <= cn(0,5) + cn(4,5). +0
1
1, 1, 1, 2, 3, 4, 5, 8, 10, 15, 18, 25, 34, 43, 58, 75, 94, 124, 153, 203, 255, 314, 395, 491, 624, 780, 939, 1168, 1421, 1777, 2179, 2611, 3185, 3846, 4707, 5721, 6785, 8194, 9780, 11837, 14199, 16753, 19996, 23707, 28338 (list; graph; listen)
OFFSET

1,4

COMMENT

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

Short: 2 <= 0 + 3 and 2 <= 0 + 4 and 3 <= 0 + 1 and 3 <= 0 + 4 (BBZAA).

CROSSREFS

Adjacent sequences: A039872 A039873 A039874 this_sequence A039876 A039877 A039878

Sequence in context: A107234 A035943 A035555 this_sequence A110539 A019997 A125157

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