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.

A238565 Number of partitions of 8^n into parts that are at most n.

This page as a plain text file.
%I A238565 #6 Jun 05 2015 16:59:04
%S A238565 0,1,33,22102,478968264,400686586344699,14330879421541116923943,
%T A238565 23444113544017670689348160755868,
%U A238565 1841159754991692001851990839259642586671980,7197738918090981779157236361118960948634130123398244711
%N A238565 Number of partitions of 8^n into parts that are at most n.
%H A238565 Alois P. Heinz, <a href="/A238565/b238565.txt">Table of n, a(n) for n = 0..35</a>
%F A238565 a(n) = [x^(8^n)] Product_{j=1..n} 1/(1-x^j).
%F A238565 a(n) ~ 8^(n*(n-1)) / (n!*(n-1)!). - _Vaclav Kotesovec_, Jun 05 2015
%Y A238565 Column k=8 of A238010.
%K A238565 nonn
%O A238565 0,3
%A A238565 _Alois P. Heinz_, Feb 28 2014