Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A039889
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A039889 Number of partitions satisfying cn(2,5) < cn(1,5) + cn(4,5) and cn(3,5) < cn(1,5) + cn(4,5). +0
2
1, 1, 1, 3, 4, 6, 9, 11, 17, 26, 32, 46, 60, 78, 111, 138, 183, 236, 297, 399, 489, 630, 794, 978, 1262, 1541, 1923, 2392, 2907, 3638, 4418, 5406, 6617, 7980, 9755, 11772, 14193, 17148, 20514, 24688, 29549, 35242, 42111, 50017, 59446 (list; graph; listen)
OFFSET

1,4

COMMENT

For a given partition cn(i,n) means the number of its parts equal to i modulo n.

Short: 2 < 1 + 4 and 3 < 1 + 4 (BBMAAp).

CROSSREFS

Sequence in context: A034034 A105527 A094345 this_sequence A118098 A022297 A010430

Adjacent sequences: A039886 A039887 A039888 this_sequence A039890 A039891 A039892

KEYWORD

nonn

AUTHOR

Olivier Gerard (ogerard(AT)ext.jussieu.fr)

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 July 19 08:04 EDT 2008. Contains 142098 sequences.


AT&T Labs Research