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!)
A339089 Number of compositions (ordered partitions) of n into distinct parts congruent to 5 mod 6. 3
1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 2, 1, 0, 0, 0, 0, 2, 1, 0, 0, 0, 0, 4, 1, 0, 0, 0, 6, 4, 1, 0, 0, 0, 6, 6, 1, 0, 0, 0, 12, 6, 1, 0, 0, 0, 18, 8, 1, 0, 0, 24, 24, 8, 1, 0, 0, 24, 30, 10, 1, 0, 0, 48, 42, 10, 1, 0, 0, 72, 48, 12, 1, 0, 0, 120, 60, 12, 1, 0, 120, 144 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,17
LINKS
FORMULA
G.f.: Sum_{k>=0} k! * x^(k*(3*k + 2)) / Product_{j=1..k} (1 - x^(6*j)).
EXAMPLE
a(33) = 6 because we have [17, 11, 5], [17, 5, 11], [11, 17, 5], [11, 5, 17], [5, 17, 11] and [5, 11, 17].
MATHEMATICA
nmax = 86; CoefficientList[Series[Sum[k! x^(k (3 k + 2))/Product[1 - x^(6 j), {j, 1, k}], {k, 0, nmax}], {x, 0, nmax}], x]
CROSSREFS
Sequence in context: A307710 A112207 A112208 * A048158 A275342 A246838
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Nov 23 2020
STATUS
approved

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 April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)