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 A035957 #8 May 10 2018 02:59:52
%S A035957 1,2,2,4,5,8,10,15,19,27,34,46,58,77,96,125,155,198,244,308,378,471,
%T A035957 574,709,860,1053,1270,1544,1854,2239,2676,3213,3824,4567,5414,6435,
%U A035957 7600,8993,10584,12474,14632,17180,20088,23505,27403,31960,37154
%N A035957 Number of partitions in parts not of the form 15k, 15k+3 or 15k-3. Also number of partitions with at most 2 parts of size 1 and differences between parts at distance 6 are greater than 1.
%C A035957 Case k=7,i=3 of Gordon Theorem.
%D A035957 G. E. Andrews, The Theory of Partitions, Addison-Wesley, 1976, p. 109.
%F A035957 a(n) ~ exp(2*Pi*sqrt(2*n/15)) * sqrt(5 - sqrt(5)) / (2^(5/4) * 15^(3/4) * n^(3/4)). - _Vaclav Kotesovec_, May 10 2018
%t A035957 nmax = 60; Rest[CoefficientList[Series[Product[(1 - x^(15*k))*(1 - x^(15*k+ 3-15))*(1 - x^(15*k- 3))/(1 - x^k), {k, 1, nmax}], {x, 0, nmax}], x]] (* _Vaclav Kotesovec_, May 10 2018 *)
%K A035957 nonn,easy
%O A035957 1,2
%A A035957 _Olivier Gérard_