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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A035971 Number of partitions of n into parts not of the form 19k, 19k+2 or 19k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 8 are greater than 1. 0
1, 1, 2, 3, 4, 6, 8, 11, 15, 20, 26, 35, 45, 58, 75, 96, 120, 153, 191, 239, 297, 368, 453, 559, 683, 834, 1015, 1233, 1489, 1800, 2164, 2599, 3112, 3720, 4432, 5278, 6262, 7422, 8777, 10365, 12208, 14368, 16869, 19783, 23157, 27073, 31591, 36831 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

COMMENTS

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

REFERENCES

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

CROSSREFS

Sequence in context: A105782 A035956 A035963 * A035980 A035990 A036001

Adjacent sequences:  A035968 A035969 A035970 * A035972 A035973 A035974

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 16 20:01 EST 2012. Contains 205955 sequences.