Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A039880
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A039880
%S A039880 0,1,1,1,2,3,4,6,8,13,16,20,27,39,51,65,82,108,139,178,222,281,354,444,
%T A039880 549,686,847,1047,1282,1570,1919,2346,2845,3448,4159,5028,6055,7278,
%U A039880 8703,10407,12430,14830,17622,20915,24768
%N A039880 Number of partitions satisfying cn(0,5) + cn(1,5) + cn(4,5) < cn(2,5) 
               + cn(3,5).
%C A039880 For a given partition cn(i,n) means the number of its parts equal to 
               i modulo n.
%C A039880 Short: 0 + 1 + 4 < 2 + 3 (ZAApMBBp).
%Y A039880 Sequence in context: A018758 A068597 A094372 this_sequence A000029 A155051 
               A018137
%Y A039880 Adjacent sequences: A039877 A039878 A039879 this_sequence A039881 A039882 
               A039883
%K A039880 nonn
%O A039880 1,5
%A A039880 Olivier Gerard (olivier.gerard(AT)gmail.com)

    
page 1

Search completed in 0.001 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