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
0, 0, 0, 1, 1, 2, 4, 6, 9, 14, 20, 29, 41, 57, 78, 106, 142, 189, 250, 327, 425, 549, 705, 900, 1144, 1445, 1819, 2279, 2844, 3534, 4379, 5403, 6648, 8152, 9969, 12152, 14780, 17920, 21682, 26163, 31504, 37842, 45371, 54270, 64800, 77211, 91842, 109031, 129235, 152897 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,6

LINKS

Table of n, a(n) for n=0..49.

FORMULA

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

CROSSREFS

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

Sequence in context: A034748 A069916 A153140 * A139135 A097197 A260600

Adjacent sequences:  A295338 A295339 A295340 * A295342 A295343 A295344

KEYWORD

nonn

AUTHOR

R. J. Mathar, Nov 20 2017

STATUS

approved

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 July 2 16:02 EDT 2020. Contains 335404 sequences. (Running on oeis4.)