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!)
A346813 Number of partitions of the (n+3)-multiset {0,0,0,1,2,...,n} into distinct multisets. 3
2, 5, 16, 59, 244, 1112, 5516, 29505, 168938, 1029271, 6639768, 45162696, 322739878, 2415567889, 18884022724, 153826198419, 1302844673004, 11451006297332, 104262283711688, 981877752182053, 9550121928456718, 95809651792320751, 990221394289370920 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

Also number of factorizations of 8 * Product_{i=1..n} prime(i+1) into distinct factors.

LINKS

Alois P. Heinz, Table of n, a(n) for n = 0..573

CROSSREFS

Row n=3 of A346520.

Cf. A169587.

Sequence in context: A185143 A280760 A000753 * A007878 A019589 A087949

Adjacent sequences:  A346810 A346811 A346812 * A346814 A346815 A346816

KEYWORD

nonn

AUTHOR

Alois P. Heinz, Aug 05 2021

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 January 18 07:55 EST 2022. Contains 350454 sequences. (Running on oeis4.)