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.

A238561 Number of partitions of 4^n into parts that are at most n.

This page as a plain text file.
%I A238561 #7 Jun 05 2015 16:56:29
%S A238561 0,1,9,374,123464,393073019,13515852419746,5357744226076852121,
%T A238561 25600195480450832892945051,1525225328241455762364837330772150,
%U A238561 1164060788951887659290296574533366111395142,11633609031659470387047660421170953987903118055988725
%N A238561 Number of partitions of 4^n into parts that are at most n.
%H A238561 Alois P. Heinz, <a href="/A238561/b238561.txt">Table of n, a(n) for n = 0..42</a>
%F A238561 a(n) = [x^(4^n)] Product_{j=1..n} 1/(1-x^j).
%F A238561 a(n) ~ 4^(n*(n-1)) / (n!*(n-1)!). - _Vaclav Kotesovec_, Jun 05 2015
%e A238561 a(2) = 9: 22222222, 222222211, 2222221111, 22222111111, 222211111111, 2221111111111, 22111111111111, 211111111111111, 1111111111111111.
%Y A238561 Column k=4 of A238010.
%K A238561 nonn
%O A238561 0,3
%A A238561 _Alois P. Heinz_, Feb 28 2014