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.
%I A220507 #26 Jan 30 2019 07:24:11
%S A220507 2,34,260,1498,6956,28024,100953,333680,1026540,2976024,8197962,
%T A220507 21608760,54788100,134217717,318816426,736549424,1659169712,
%U A220507 3652248590,7870890952,16633964444,34522173765,70450341042,141526909340,280158178412
%N A220507 a(n) = spt(7n+5)/7 where spt(n) = A092269(n).
%C A220507 That spt(7n+5) == 0 (mod 7) is one of the congruences stated by George E. Andrews. See theorem 2 in the Andrews' paper. See also A220505 and A220513.
%H A220507 G. E. Andrews, <a href="http://www.math.psu.edu/vstein/alg/antheory/preprint/andrews/17.pdf">The number of smallest parts in the partitions of n</a>
%H A220507 G. E. Andrews, F. G. Garvan, and J. Liang, <a href="http://www.math.psu.edu/andrews/pdf/287.pdf">Combinatorial interpretation of congruences for the spt-function</a>
%H A220507 K. C. Garrett, C. McEachern, T. Frederick, O. Hall-Holt, <a href="http://www.deepdyve.com/lp/elsevier/fast-computation-of-andrews-smallest-part-statistic-and-conjectured-pV0SFgLi27/1">Fast computation of Andrews' smallest part statistic and conjectured congruences</a>, Discrete Applied Mathematics, 159 (2011), 1377-1380.
%H A220507 F. G. Garvan, <a href="http://www.math.ufl.edu/~fgarvan/papers/spt.pdf">Congruences for Andrews' smallest parts partition function and new congruences for Dyson's rank</a>
%H A220507 F. G. Garvan, <a href="http://www.math.ufl.edu/~fgarvan/papers/spt2.pdf">Congruences for Andrews' spt-function modulo powers of 5, 7 and 13</a>
%H A220507 F. G. Garvan, <a href="http://arxiv.org/abs/1011.1957">Congruences for Andrews' spt-function modulo 32760 and extension of Atkin's Hecke-type partition congruences</a>, arXiv:1011.1957 [math.NT], 2010.
%H A220507 K. Ono, <a href="http://www.mathcs.emory.edu/~ono/publications-cv/pdfs/131.pdf">Congruences for the Andrews spt-function</a>
%F A220507 a(n) = A092269(A017041(n))/7 = A220502(n)/7.
%t A220507 b[n_, i_] := b[n, i] = If[n==0 || i==1, n, {q, r} = QuotientRemainder[n, i]; If[r == 0, q, 0] + Sum[b[n - i*j, i - 1], {j, 0, n/i}]];
%t A220507 spt[n_] := b[n, n];
%t A220507 a[n_] := spt[7 n + 5]/7;
%t A220507 Table[a[n], {n, 0, 23}] (* _Jean-François Alcover_, Jan 30 2019, after _Alois P. Heinz_ in A092269 *)
%Y A220507 Cf. A017041, A071746, A092269, A220502, A220505, A220513.
%K A220507 nonn
%O A220507 0,1
%A A220507 _Omar E. Pol_, Jan 18 2013