Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A039851
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A039851
%S A039851 1,2,3,4,6,8,10,13,17,22,28,34,41,52,64,78,92,110,133,160,190,222,260,
%T A039851 308,362,423,489,566,658,764,880,1009,1156,1328,1523,1739,1976,2247,
%U A039851 2556,2905,3289,3715,4192,4734,5339
%N A039851 Number of partitions satisfying cn(0,5) + cn(2,5) <= 1 and cn(0,5) + 
               cn(3,5) <= 1.
%C A039851 For a given partition cn(i,n) means the number of its parts equal to 
               i modulo n.
%C A039851 Short: 0 + 2 <= u and 0 + 3 <= u (ZBBU).
%Y A039851 Sequence in context: A123015 A005434 A027589 this_sequence A028290 A003107 
               A014977
%Y A039851 Adjacent sequences: A039848 A039849 A039850 this_sequence A039852 A039853 
               A039854
%K A039851 nonn
%O A039851 1,2
%A A039851 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