|
| |
|
|
A035939
|
|
Number of partitions of n into parts not of the form 7k, 7k+3 or 7k-3. Also number of partitions with at most 2 parts of size 1 and differences between parts at distance 2 are greater than 1.
|
|
0
| |
|
|
1, 2, 2, 3, 4, 6, 7, 10, 12, 16, 19, 25, 30, 38, 46, 57, 68, 84, 99, 121, 143, 172, 202, 242, 283, 336, 392, 462, 537, 630, 729, 851, 982, 1140, 1312, 1518, 1741, 2006, 2295, 2635, 3007, 3442, 3917, 4470, 5077, 5776, 6545, 7429, 8399, 9510, 10731
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| Case k=3,i=3 of Gordon Theorem.
|
|
|
REFERENCES
| G. E. Andrews, The Theory of Partitions, Addison-Wesley, 1976, p. 109.
|
|
|
MAPLE
| # See A035937 for GordonsTheorem
A035939_list := n -> GordonsTheorem([1, 1, 0, 0, 1, 1, 0], n):
A035939_list(40); # Peter Luschny, Jan 22 2012
|
|
|
PROG
| (Sage) # See A035937 for GordonsTheorem
def A035939_list(len) : return GordonsTheorem([1, 1, 0, 0, 1, 1, 0], len)
A035939_list(40) # Peter Luschny, Jan 22 2012
|
|
|
CROSSREFS
| Sequence in context: A026928 A102464 A082538 * A116665 A122135 A027194
Adjacent sequences: A035936 A035937 A035938 * A035940 A035941 A035942
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| Olivier Gerard (olivier.gerard(AT)gmail.com)
|
| |
|
|
