# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a238633
Showing 1-1 of 1

%I A238633 #6 Mar 01 2014 19:19:04
%S A238633 1,11,2432,6889527,44056912182,331281477244572,2561606354507677872,
%T A238633 19900384510848921094632,154721208025657067873668152,
%U A238633 1203080775953722005263023646232,9355115500676554620340590943203672,72745325498731282220397926627254957272
%N A238633 Number of partitions of 6^n into parts that are at most 6.
%H A238633 Alois P. Heinz, <a href="/A238633/b238633.txt">Table of n, a(n) for n = 0..250</a>
%F A238633 a(n) = [x^(6^n)] Product_{j=1..6} 1/(1-x^j).
%F A238633 G.f.: -(29386561536*x^7 +220531481280*x^6 +188259164496*x^5 -77061923145*x^4 +2575778195*x^3 -12336681*x^2 +9320*x-1) / Product_{j=0..5} 1-6^j*x.
%p A238633 gf:= -(29386561536*x^7 +220531481280*x^6 +188259164496*x^5 -77061923145*x^4 +2575778195*x^3 -12336681*x^2+9320*x-1)/ mul(1-6^j*x, j=0..5):
%p A238633 a:= n-> coeff(series(gf, x, n+1), x, n):
%p A238633 seq(a(n), n=0..20);
%Y A238633 Row n=6 of A238016.
%K A238633 nonn
%O A238633 0,2
%A A238633 _Alois P. Heinz_, Mar 01 2014

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE