cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A111329 Number of partitions of T where T = (3n + 1) if n is even and T=(3n + 1)/2 if n is odd.

Original entry on oeis.org

2, 15, 7, 101, 22, 490, 56, 1958, 135, 6842, 297, 21637, 627, 63261, 1255, 173525, 2436, 451276, 4565, 1121505, 8349, 2679689, 14883, 6185689, 26015, 13848650, 44583, 30167357, 75175, 64112359, 124754, 133230930, 204226, 271248950, 329931
Offset: 1

Views

Author

Parthasarathy Nambi, Nov 04 2005

Keywords

Examples

			If n=1 then T = 2 and a(1) = 2.
		

Crossrefs

Programs

  • Mathematica
    f[n_] := If[EvenQ[n], PartitionsP[3n + 1], PartitionsP[(3n + 1)/2]]; Table[ f[n], {n, 35}] (* Robert G. Wilson v, Nov 07 2005 *)

Formula

a(n) = A000041(A165355(n-1)). [Reinhard Zumkeller, Nov 19 2009]