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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A035973 Number of partitions of n into parts not of the form 19k, 19k+4 or 19k-4. Also number of partitions with at most 3 parts of size 1 and differences between parts at distance 8 are greater than 1. 0
1, 2, 3, 4, 6, 9, 12, 17, 23, 31, 41, 55, 71, 93, 119, 153, 194, 247, 309, 389, 484, 602, 743, 918, 1124, 1378, 1679, 2043, 2474, 2995, 3606, 4341, 5204, 6231, 7436, 8866, 10534, 12506, 14804, 17504, 20645, 24325, 28589, 33569, 39332, 46032, 53771 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

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

REFERENCES

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

CROSSREFS

Sequence in context: A105781 A035958 A035965 * A035982 A035992 A036003

Adjacent sequences:  A035970 A035971 A035972 * A035974 A035975 A035976

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 14 22:48 EST 2012. Contains 205682 sequences.