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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A035943 Number of partitions of n into parts not of the form 9k, 9k+4 or 9k-4. Also number of partitions with at most 3 parts of size 1 and differences between parts at distance 3 are greater than 1. 1
1, 2, 3, 4, 5, 8, 10, 14, 18, 24, 30, 40, 49, 63, 78, 98, 120, 150, 182, 224, 271, 330, 396, 480, 572, 687, 817, 974, 1151, 1367, 1608, 1898, 2226, 2614, 3053, 3573, 4157, 4844, 5620, 6524, 7544, 8731, 10066, 11611, 13353, 15356, 17612, 20203, 23112 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

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

REFERENCES

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

CROSSREFS

Sequence in context: A058664 A035562 A107234 * A035555 A039875 A110539

Adjacent sequences:  A035940 A035941 A035942 * A035944 A035945 A035946

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 14:50 EST 2012. Contains 206050 sequences.