This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A197183 Number of partitions of n^2 into distinct factorials. 4
 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0 COMMENTS a(n) = A115944(n^2); a(A014597(n)) > 0. LINKS Reinhard Zumkeller, Table of n, a(n) for n = 0..10000 PROG (Haskell) a197183 = a115944 . a000290 CROSSREFS Cf. A197182, A000290. Sequence in context: A322586 A147612 A323509 * A295405 A267001 A141735 Adjacent sequences:  A197180 A197181 A197182 * A197184 A197185 A197186 KEYWORD nonn AUTHOR Reinhard Zumkeller, Dec 04 2011 STATUS approved

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

Last modified October 20 20:24 EDT 2019. Contains 328273 sequences. (Running on oeis4.)