Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A039869
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A039869
%S A039869 1,1,1,3,5,6,8,12,18,26,33,45,62,82,107,140,184,239,304,388,494,631,
%T A039869 793,989,1236,1544,1918,2372,2915,3582,4393,5372,6540,7943,9624,11648,
%U A039869 14055,16916,20310,24357,29143,34796,41461,49336,58597
%N A039869 Number of partitions satisfying cn(2,5) + cn(3,5) < cn(0,5) + cn(1,5) 
               + cn(4,5).
%C A039869 For a given partition cn(i,n) means the number of its parts equal to 
               i modulo n.
%C A039869 Short: 2 + 3 < 0 + 1 + 4 (BBpMZAAp).
%Y A039869 Sequence in context: A062832 A089085 A033163 this_sequence A076210 A039014 
               A102989
%Y A039869 Adjacent sequences: A039866 A039867 A039868 this_sequence A039870 A039871 
               A039872
%K A039869 nonn
%O A039869 1,4
%A A039869 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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research