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 A035955 #8 May 10 2018 02:58:04
%S A035955 0,1,1,2,2,4,4,7,8,12,14,21,24,33,40,53,64,84,100,129,155,195,234,293,
%T A035955 349,431,515,629,748,909,1076,1298,1535,1837,2166,2582,3032,3595,4214,
%U A035955 4972,5810,6831,7959,9321,10837,12643,14662,17057,19728,22880,26409
%N A035955 Number of partitions in parts not of the form 15k, 15k+1 or 15k-1. Also number of partitions with no part of size 1 and differences between parts at distance 6 are greater than 1.
%C A035955 Case k=7,i=1 of Gordon Theorem.
%D A035955 G. E. Andrews, The Theory of Partitions, Addison-Wesley, 1976, p. 109.
%F A035955 a(n) ~ exp(2*Pi*sqrt(2*n/15)) * 2^(1/4) * sin(Pi/15) / (15^(3/4) * n^(3/4)). - _Vaclav Kotesovec_, May 10 2018
%t A035955 nmax = 60; Rest[CoefficientList[Series[Product[(1 - x^(15*k))*(1 - x^(15*k+ 1-15))*(1 - x^(15*k- 1))/(1 - x^k), {k, 1, nmax}], {x, 0, nmax}], x]] (* _Vaclav Kotesovec_, May 10 2018 *)
%K A035955 nonn,easy
%O A035955 1,4
%A A035955 _Olivier Gérard_