Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A039897
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A039897
%S A039897 0,1,2,3,4,7,11,17,23,32,44,63,85,114,149,198,260,341,436,559,712,910,
%T A039897 1149,1446,1803,2254,2803,3478,4282,5267,6453,7905,9635,11716,14191,
%U A039897 17180,20735,24985,29998,35965,43019,51404,61257,72880,86510
%N A039897 Number of partitions satisfying 0 < cn(2,5) + cn(3,5).
%C A039897 For a given partition cn(i,n) means the number of its parts equal to 
               i modulo n.
%C A039897 Short: o < 2 + 3 (OMBBp).
%Y A039897 Sequence in context: A025048 A017987 A165407 this_sequence A050193 A072164 
               A060987
%Y A039897 Adjacent sequences: A039894 A039895 A039896 this_sequence A039898 A039899 
               A039900
%K A039897 nonn
%O A039897 1,3
%A A039897 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 1 13:27 EST 2009. Contains 167806 sequences.


AT&T Labs Research