login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A035978 Number of partitions of n into parts not of the form 19k, 19k+9 or 19k-9. Also number of partitions with at most 8 parts of size 1 and differences between parts at distance 8 are greater than 1. 0
1, 2, 3, 5, 7, 11, 15, 22, 29, 40, 53, 72, 93, 123, 158, 205, 260, 333, 418, 529, 659, 824, 1019, 1264, 1551, 1908, 2328, 2843, 3448, 4185, 5048, 6092, 7313, 8777, 10489, 12531, 14910, 17733, 21019, 24896, 29399, 34692, 40824, 48004, 56307 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

Case k=9,i=9 of Gordon Theorem.

REFERENCES

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

CROSSREFS

Sequence in context: A026814 A008637 A008631 * A023029 A035987 A035997

Adjacent sequences:  A035975 A035976 A035977 * A035979 A035980 A035981

KEYWORD

nonn,easy

AUTHOR

Olivier Gerard (olivier.gerard(AT)gmail.com)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 18:41 EST 2012. Contains 206074 sequences.