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!)
A161105 Number of partitions of n into nonzero triangular numbers where every part appears at least 4 times 1

%I

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

%T 10,13,11,11,13,15,14,18,16,17,20,21,21,26,24,25,28,30,29,36,35,35,40,

%U 42,42,51,48,49,54,59,59,67,66,68,75,79,78,89,86,90,100,103,102,115,116,120,129

%N Number of partitions of n into nonzero triangular numbers where every part appears at least 4 times

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

%K nonn

%O 1,12

%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 October 20 22:22 EDT 2021. Contains 348119 sequences. (Running on oeis4.)