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 A277264 #12 Oct 10 2016 02:39:54
%S A277264 1,0,0,0,0,0,1,0,0,0,0,1,1,0,0,0,1,1,1,0,0,1,2,1,1,0,1,2,2,1,1,1,3,3,
%T A277264 2,1,2,3,4,3,2,2,5,5,5,3,3,5,8,6,5,4,7,9,10,7,6,8,12,12,11,8,11,15,17,
%U A277264 14,13,13,19,21,20,16,19,23,28,26,23,23,31,34,35,30,31,37,46,44,41,39,48,55,59,52,52,59,71,73,71,65,75,87,94
%N A277264 Expansion of Product_{k>=1} 1/(1 - x^(5*k+1)).
%C A277264 Number of partitions of n into parts larger than 1 and congruent to 1 mod 5.
%H A277264 <a href="/index/Par#partN">Index entries for related partition-counting sequences</a>
%F A277264 G.f.: Product_{k>=1} 1/(1 - x^(5*k+1)).
%F A277264 a(n) ~ Pi^(1/5) * Gamma(1/5) * exp(Pi*sqrt(2*n/15)) / (2^(21/10) * 3^(3/5) * 5^(9/10) * n^(11/10)). - _Vaclav Kotesovec_, Oct 09 2016
%e A277264 a(22) = 2, because we have [16, 6] and [11, 11].
%t A277264 CoefficientList[Series[(1 - x)/QPochhammer[x, x^5], {x, 0, 100}], x]
%Y A277264 Cf. A016861, A087897, A109697 (partial sums), A117957, A277210.
%K A277264 nonn
%O A277264 0,23
%A A277264 _Ilya Gutkovskiy_, Oct 07 2016