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!)
A295341 The number of partitions of n in which at least one part is a multiple of 3. 1

%I

%S 0,0,0,1,1,2,4,6,9,14,20,29,41,57,78,106,142,189,250,327,425,549,705,

%T 900,1144,1445,1819,2279,2844,3534,4379,5403,6648,8152,9969,12152,

%U 14780,17920,21682,26163,31504,37842,45371,54270,64800,77211,91842,109031,129235,152897

%N The number of partitions of n in which at least one part is a multiple of 3.

%F a(n) = A000041(n)-A000726(n).

%Y Cf. A000041, A000726, A047967 (at least one multiple of 2), A295342 (at least one multiple of 4).

%K nonn

%O 0,6

%A _R. J. Mathar_, Nov 20 2017

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 7 19:57 EDT 2020. Contains 336279 sequences. (Running on oeis4.)