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.

A220503 spt(13n+6) where spt(n) = A092269(n).

This page as a plain text file.
%I A220503 #12 Jan 22 2013 12:32:01
%S A220503 26,1820,39546,494702,4474756,32347380,198063060,1065041120,
%T A220503 5155845968,22871059718,94204920680,363981624370,1329826483453,
%U A220503 4624153352104,15385030362884,49194117590072,151738308808580,452922550115880,1311857021146256
%N A220503 spt(13n+6) where spt(n) = A092269(n).
%C A220503 a(n) is divisible by 13 (see A220513).
%H A220503 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>
%F A220503 a(n) = A092269(A186113(n)).
%Y A220503 Cf. A092269, A186113, A213256, A220485, A220502, A220513.
%K A220503 nonn
%O A220503 0,1
%A A220503 _Omar E. Pol_, Jan 18 2013