The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A221141 Third-order spt function. 6
0, 0, 1, 7, 28, 85, 217, 497, 1036, 2044, 3787, 6797, 11648, 19558, 31703, 50645, 78674, 120932, 181664, 270600, 395682, 574329, 820834, 1166109, 1634668, 2279242, 3142903, 4312063, 5859616, 7927745, 10635129, 14209328, 18846744, 24900807, 32688145, 42761047 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
Jean-François Alcover, Table of n, a(n) for n = 1..50
F. G. Garvan, Higher-order spt functions, preprint.
F. G. Garvan, Higher-order spt functions, arXiv:1008.1207 [math.NT], 2010.
F. G. Garvan, Higher-order spt functions, Adv. Math. 228 (2011), no. 1, 241-265.
MATHEMATICA
om[3, p_List] := Module[{pu, m, f}, pu = Union[p]; m = Length[pu]; f[j_] := Count[p, pu[[j]]]; Binomial[f[1] + 2, 5] + Binomial[f[1] + 1, 3] Sum[ Binomial[f[j] + 1, 2], {j, 2, m}] + f[1] Sum[Binomial[f[j] + 2, 4], {j, 2, m}] + f[1] Sum[Binomial[f[j] + 1, 2] Binomial[f[k] + 1, 2], {j, 2, m}, {k, j + 1, m}]];
spt[3, n_] := Sum[om[3, p], {p, IntegerPartitions[n]}];
Table[spt[3, n], {n, 1, 29}] (* Jean-François Alcover, Mar 30 2020 *)
CROSSREFS
Sequence in context: A369808 A145135 A369807 * A144900 A054469 A369806
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Jan 02 2013
EXTENSIONS
More terms from Jean-François Alcover, Mar 30 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 May 15 01:31 EDT 2024. Contains 372536 sequences. (Running on oeis4.)