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 A035956 #8 May 10 2018 02:59:02
%S A035956 1,1,2,3,4,6,8,11,15,20,26,35,44,57,73,93,116,147,183,228,282,348,426,
%T A035956 524,637,775,939,1136,1366,1645,1969,2356,2809,3345,3969,4709,5564,
%U A035956 6570,7739,9105,10683,12527,14651,17120,19965,23257,27039,31412,36420
%N A035956 Number of partitions of n into parts not of the form 15k, 15k+2 or 15k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 6 are greater than 1.
%C A035956 Case k=7,i=2 of Gordon Theorem.
%D A035956 G. E. Andrews, The Theory of Partitions, Addison-Wesley, 1976, p. 109.
%F A035956 a(n) ~ exp(2*Pi*sqrt(2*n/15)) * 2^(1/4) * sin(2*Pi/15) / (15^(3/4) * n^(3/4)). - _Vaclav Kotesovec_, May 10 2018
%t A035956 nmax = 60; Rest[CoefficientList[Series[Product[(1 - x^(15*k))*(1 - x^(15*k+ 2-15))*(1 - x^(15*k- 2))/(1 - x^k), {k, 1, nmax}], {x, 0, nmax}], x]] (* _Vaclav Kotesovec_, May 10 2018 *)
%K A035956 nonn,easy
%O A035956 1,3
%A A035956 _Olivier Gérard_