Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A039895
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A039895
%S A039895 1,1,2,4,5,8,10,15,22,28,39,53,69,93,118,157,202,260,332,418,533,675,
%T A039895 841,1054,1303,1624,2012,2475,3034,3714,4538,5543,6720,8137,9831,11869,
%U A039895 14295,17157,20538,24579,29331,34985,41579,49344,58507
%N A039895 Number of partitions satisfying cn(2,5) + cn(3,5) <= cn(1,5) + cn(4,5).
%C A039895 For a given partition cn(i,n) means the number of its parts equal to 
               i modulo n.
%C A039895 Short: 2 + 3 <= 1 + 4 (BBpAAp).
%Y A039895 Sequence in context: A101274 A080222 A050539 this_sequence A105425 A032937 
               A126684
%Y A039895 Adjacent sequences: A039892 A039893 A039894 this_sequence A039896 A039897 
               A039898
%K A039895 nonn
%O A039895 1,3
%A A039895 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