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.

A238567 Number of partitions of 10^n into parts that are at most n.

This page as a plain text file.
%I A238567 #6 Jun 05 2015 17:00:16
%S A238567 0,1,51,83834,6954866112,34732639965323612,11574681724845786651679939,
%T A238567 275575507062293332528670070330578043,
%U A238567 492095606182604983628979092635386202795929807572,68346538155515186680097859376764556127526656338966443473179293
%N A238567 Number of partitions of 10^n into parts that are at most n.
%H A238567 Alois P. Heinz, <a href="/A238567/b238567.txt">Table of n, a(n) for n = 0..33</a>
%F A238567 a(n) = [x^(10^n)] Product_{j=1..n} 1/(1-x^j).
%F A238567 a(n) ~ 10^(n*(n-1)) / (n!*(n-1)!). - _Vaclav Kotesovec_, Jun 05 2015
%Y A238567 Column k=10 of A238010.
%K A238567 nonn
%O A238567 0,3
%A A238567 _Alois P. Heinz_, Feb 28 2014