|
| |
|
|
A213261
|
|
p(7n+5) where p(k) = number of partitions of k = A000041(k).
|
|
2
|
|
|
|
7, 77, 490, 2436, 10143, 37338, 124754, 386155, 1121505, 3087735, 8118264, 20506255, 49995925, 118114304, 271248950, 607163746, 1327710076, 2841940500, 5964539504, 12292341831, 24908858009, 49686288421, 97662728555, 189334822579, 362326859895, 684957390936, 1280011042268, 2366022741845, 4328363658647, 7840656226137
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,1
|
|
|
COMMENTS
|
It is known that a(n) is divisible by 7 (see A071746).
|
|
|
LINKS
|
Table of n, a(n) for n=0..29.
Lasse Winquist, An elementary proof of p(11m+6) == 0 (mod 11), J. Combinatorial Theory 6 1969 56--59. MR0236136 (38 #4434). - From N. J. A. Sloane, Jun 07 2012
|
|
|
FORMULA
|
a(n) = A000041(A017041(n)). - Omar E. Pol, Jan 18 2013
|
|
|
PROG
|
(PARI) a(n) = numbpart(7*n+5); \\ Michel Marcus, Jan 07 2015
|
|
|
CROSSREFS
|
Cf. A000041, A071746, A213260, A071734, A213256, A076394.
Sequence in context: A059195 A139264 A045642 * A068667 A261741 A228414
Adjacent sequences: A213258 A213259 A213260 * A213262 A213263 A213264
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
N. J. A. Sloane, Jun 07 2012
|
|
|
STATUS
|
approved
|
| |
|
|
