login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A197182 Number of partitions of n^2 into factorial parts. 3

%I #9 Mar 19 2020 22:54:24

%S 1,1,3,7,18,36,82,153,300,520,915,1477,2437,3801,6027,9095,13824,

%T 20194,29734,42254,60348,83730,116565,158215,215375,286691,382461,

%U 500451,656130,846385,1094530,1395787,1784670,2254093,2853849,3573051,4482825,5565849,6922008

%N Number of partitions of n^2 into factorial parts.

%C a(n) = A064986(n^2).

%H Alois P. Heinz, <a href="/A197182/b197182.txt">Table of n, a(n) for n = 0..1000</a>

%H <a href="/index/Fa#factorial">Index entries for sequences related to factorial numbers</a>

%o (Haskell)

%o a197182 = a064986 . a000290

%Y Cf. A197183.

%K nonn

%O 0,3

%A _Reinhard Zumkeller_, Dec 04 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 17:20 EDT 2024. Contains 371962 sequences. (Running on oeis4.)