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!)
A099199 Number of partitions of n into odd triangular numbers. 1

%I #5 Sep 15 2024 19:17:29

%S 1,1,2,2,2,3,3,3,4,4,4,5,5,5,7,7,7,9,9,9,12,12,12,15,15,15,18,18,18,

%T 22,22,22,26,26,26,31,31,31,36,36,36,42,42,42,50,50,50,58,58,58,67,67,

%U 67,76,77,77,87,88,88,100,101,101,114,115,115,130,131,131,146,148,148,164

%N Number of partitions of n into odd triangular numbers.

%e a(8) = #{3+3+1+1, 3+1+1+1+1+1, 1+1+1+1+1+1+1+1} = 3.

%t Table[Count[IntegerPartitions[n],_?(AllTrue[#,OddQ]&&AllTrue[Sqrt[8#+1],OddQ]&)],{n,80}] (* _Harvey P. Dale_, Sep 15 2024 *)

%Y Cf. A099200, A007294, A000041, A000217.

%K nonn,changed

%O 1,3

%A _Reinhard Zumkeller_, Oct 04 2004

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 September 16 23:59 EDT 2024. Contains 375984 sequences. (Running on oeis4.)