This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A213256 #22 Nov 08 2023 07:50:19 %S A213256 11,297,3718,31185,204226,1121505,5392783,23338469,92669720,342325709, %T A213256 1188908248,3913864295,12292341831,37027355200,107438159466, %U A213256 301384802048,819876908323,2168627105469,5590088317495,14070545699287,34643126322519,83561103925871,197726516681672,459545750448675,1050197489931117 %N A213256 p(11n+6) where p(k) = number of partitions of k = A000041(k). %C A213256 It is known that a(n) is divisible by 11 (see A076394). %H A213256 Seiichi Manyama, <a href="/A213256/b213256.txt">Table of n, a(n) for n = 0..1000</a> %H A213256 K. Ono, <a href="https://doi.org/10.1006/jnth.1998.2354">On the Circular Summation of the Eleventh Powers of Ramanujan's Theta Function</a>, Journal of Number Theory, Volume 76, Issue 1, May 1999, Pages 62-65. %H A213256 Lasse Winquist, <a href="http://dx.doi.org/10.1016/S0021-9800(69)80105-5">An elementary proof of p(11m+6) == 0 (mod 11)</a>, J. Combinatorial Theory 6 1969 56-59. MR0236136 (38 #4434). - From _N. J. A. Sloane_, Jun 07 2012 %F A213256 a(n) = A000041(A017461(n)). - _Omar E. Pol_, Jan 18 2013 %t A213256 PartitionsP[11Range[0,30]+6] (* _Paolo Xausa_, Nov 08 2023 *) %o A213256 (PARI) a(n) = numbpart(11*n+6); \\ _Michel Marcus_, Jan 07 2015 %Y A213256 Cf. A000041, A076394. %K A213256 nonn %O A213256 0,1 %A A213256 _N. J. A. Sloane_, Jun 07 2012