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!)
A161097 Number of partitions of n into squares where every part appears at least 9 times 1

%I #4 Mar 31 2012 12:35:30

%S 0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,

%T 1,2,1,1,1,2,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,6,6,6,6,7,7,7,7,8,

%U 8,8,8,9,9,9,9,10,10,10,10,11,12,11,11,12,12,12,12,13,13,15,14,15,15,15,15,16,16,16,18,18,18

%N Number of partitions of n into squares where every part appears at least 9 times

%H R. H. Hardin, <a href="/A161097/b161097.txt">Table of n, a(n) for n=1..1000</a>

%K nonn

%O 1,36

%A _R. H. Hardin_ Jun 02 2009

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 May 2 12:49 EDT 2024. Contains 372196 sequences. (Running on oeis4.)