Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036009
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036009 Number of partitions of n into parts not of the form 25k, 25k+10 or 25k-10. Also number of partitions with at most 9 parts of size 1 and differences between parts at distance 11 are greater than 1. +0
1
1, 2, 3, 5, 7, 11, 15, 22, 30, 41, 55, 75, 98, 130, 168, 219, 280, 360, 455, 578, 725, 910, 1132, 1410, 1740, 2149, 2636, 3232, 3940, 4801, 5819, 7050, 8503, 10245, 12298, 14749, 17625, 21042, 25045, 29776, 35305, 41815, 49400, 58300, 68648 (list; graph; listen)
OFFSET

1,2

COMMENT

Case k=12,i=10 of Gordon Theorem.

REFERENCES

G. E. Andrews, The Theory of Partitions, Addison-Wesley, 1976, p. 109.

CROSSREFS

Adjacent sequences: A036006 A036007 A036008 this_sequence A036010 A036011 A036012

Sequence in context: A035998 A137792 A039905 this_sequence A053691 A026816 A008639

KEYWORD

nonn,easy

AUTHOR

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 October 15 20:12 EDT 2008. Contains 145099 sequences.


AT&T Labs Research