login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A111295
Number of partitions of 3n+1.
2
1, 5, 15, 42, 101, 231, 490, 1002, 1958, 3718, 6842, 12310, 21637, 37338, 63261, 105558, 173525, 281589, 451276, 715220, 1121505, 1741630, 2679689, 4087968, 6185689, 9289091, 13848650, 20506255, 30167357, 44108109, 64112359, 92669720, 133230930, 190569292
OFFSET
0,2
COMMENTS
Old name was: P(3*n + 1) where P(m) is the unrestricted partition of m and n = 1,2,3,... .
a(n) is also the number of partitions of 4n-2 that include n as a part; see Comment at A000041. - Clark Kimberling, Mar 03 2014
LINKS
FORMULA
a(n) = A000041(A016777(n)). - Michel Marcus, Sep 01 2021
EXAMPLE
If n=25 then P(3*25 + 1) = 9289091.
MATHEMATICA
Table[PartitionsP[3 n + 1], {n, 0, 10}]
PROG
(PARI) a(n) = numbpart(3*n+1); \\ Michel Marcus, Mar 04 2014
CROSSREFS
KEYWORD
nonn
AUTHOR
Parthasarathy Nambi, Nov 01 2005
EXTENSIONS
Better name from Clark Kimberling, Mar 02 2014
STATUS
approved