The OEIS is supported by the many generous donors to the OEIS Foundation.

 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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A363075 Number of partitions of n such that 3*(least part) + 1 = greatest part. 3
 0, 0, 0, 0, 1, 1, 2, 3, 6, 6, 10, 12, 18, 20, 27, 32, 42, 47, 59, 67, 85, 94, 113, 126, 152, 169, 198, 220, 257, 282, 326, 359, 413, 452, 512, 563, 639, 695, 781, 853, 958, 1041, 1161, 1261, 1402, 1524, 1685, 1827, 2021, 2186, 2407, 2604, 2861, 3088, 3385, 3657, 4002, 4316, 4704, 5069, 5531 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,7 LINKS Table of n, a(n) for n=1..61. FORMULA G.f.: Sum_{k>=1} x^(4*k+1)/Product_{j=k..3*k+1} (1-x^j). PROG (PARI) my(N=70, x='x+O('x^N)); concat([0, 0, 0, 0], Vec(sum(k=1, N, x^(4*k+1)/prod(j=k, 3*k+1, 1-x^j)))) CROSSREFS Cf. A049820, A237828, A363076, A363077. Cf. A237825. Sequence in context: A328565 A308762 A155215 * A119319 A069808 A131259 Adjacent sequences: A363072 A363073 A363074 * A363076 A363077 A363078 KEYWORD nonn AUTHOR Seiichi Manyama, May 17 2023 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.

Last modified December 2 16:29 EST 2023. Contains 367525 sequences. (Running on oeis4.)