Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036858
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A036858
%S A036858 0,0,0,0,0,0,0,0,1,1,1,1,1,4,4,4,5,5,12,12,12,15,15,29,31,31,40,40,67,
%T A036858 73,74,95,96,148,164,167,215,219,321,358,366,465,478,680,760
%N A036858 Number of partitions satisfying either one of the two conditions cn(0,
               5) = cn(2,5) < cn(3,5) = cn(4,5) < cn(1,5) or cn(3,5) = cn(4,5) < 
               cn(0,5) = cn(2,5) < cn(1,5).
%C A036858 For a given partition cn(i,n) means the number of its parts equal to 
               i modulo n.
%C A036858 Short: (0 = 2 < 3 = 4 < 1) or (3 = 4 < 0 = 2 < 1).
%Y A036858 Sequence in context: A134992 A073260 A036854 this_sequence A131957 A127932 
               A006075
%Y A036858 Adjacent sequences: A036855 A036856 A036857 this_sequence A036859 A036860 
               A036861
%K A036858 nonn,more
%O A036858 1,14
%A A036858 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 December 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research