login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A213256 p(11n+6) where p(k) = number of partitions of k = A000041(k). 7
11, 297, 3718, 31185, 204226, 1121505, 5392783, 23338469, 92669720, 342325709, 1188908248, 3913864295, 12292341831, 37027355200, 107438159466, 301384802048, 819876908323, 2168627105469, 5590088317495, 14070545699287, 34643126322519, 83561103925871, 197726516681672, 459545750448675, 1050197489931117 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

It is known that a(n) is divisible by 11 (see A076394).

LINKS

Seiichi Manyama, Table of n, a(n) for n = 0..1000

K. Ono, On the Circular Summation of the Eleventh Powers of Ramanujan's Theta Function, Journal of Number Theory, Volume 76, Issue 1, May 1999, Pages 62-65.

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(A017461(n)). - Omar E. Pol, Jan 18 2013

PROG

(PARI) a(n) = numbpart(11*n+6); \\ Michel Marcus, Jan 07 2015

CROSSREFS

Cf. A000041, A076394.

Sequence in context: A133515 A258191 A165390 * A067424 A001538 A101269

Adjacent sequences:  A213253 A213254 A213255 * A213257 A213258 A213259

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Jun 07 2012

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 8 03:38 EDT 2020. Contains 335504 sequences. (Running on oeis4.)