login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A161096 Number of partitions of n into squares where every part appears at least 8 times 1

%I

%S 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,2,1,1,

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

%U 9,9,9,12,10,10,10,12,11,11,11,14,14,13,13,15,14,14,14,16,16,17,16,18,17,17,17,19,18,19,20

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

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

%K nonn

%O 1,32

%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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 3 08:53 EDT 2020. Contains 336197 sequences. (Running on oeis4.)