cp's OEIS Frontend

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.

A238611 Number of partitions of n^6 into parts that are at most n.

This page as a plain text file.
%I A238611 #8 May 25 2015 10:18:14
%S A238611 1,1,33,44652,478968264,20735819929227,2561606354507677872,
%T A238611 731267824140098782358035,418829370245413954052212657987,
%U A238611 435014756168760380909523387186194290,759593815557626617904440619008375351308296,2102438285027143559802785522708457578986076133973
%N A238611 Number of partitions of n^6 into parts that are at most n.
%H A238611 Alois P. Heinz, <a href="/A238611/b238611.txt">Table of n, a(n) for n = 0..60</a>
%F A238611 a(n) = [x^(n^6)] Product_{j=1..n} 1/(1-x^j).
%F A238611 a(n) ~ exp(2*n) * n^(4*n-6) / (2*Pi). - _Vaclav Kotesovec_, May 25 2015
%Y A238611 Column k=6 of A238016.
%K A238611 nonn
%O A238611 0,3
%A A238611 _Alois P. Heinz_, Mar 01 2014