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 A135631 #25 Oct 25 2016 14:39:15
%S A135631 0,31,62,93,124,155,186,217,248,279,310,341,372,403,434,465,496,527,
%T A135631 558,589,620,651,682,713,744,775,806,837,868,899,930,961,992,1023,
%U A135631 1054,1085,1116,1147,1178,1209,1240,1271,1302,1333,1364,1395,1426,1457,1488
%N A135631 Multiples of 31.
%C A135631 a(1) = 31 is the third Mersenne prime. a(8) = 248 is the dimensions of E_8. a(16) = 496 is the third perfect number. - Pol
%C A135631 a(n)^340 = 155 mod 341 unless a(n) is also divisible by 11. - _Alonso del Arte_, Feb 15 2012
%C A135631 Number of sides on n triacontakaihenagons (31-gons). - _Wesley Ivan Hurt_, Oct 25 2016
%H A135631 G. C. Greubel, <a href="/A135631/b135631.txt">Table of n, a(n) for n = 0..1000</a>
%H A135631 Luis Manuel Rivera, <a href="http://arxiv.org/abs/1406.3081">Integer sequences and k-commuting permutations</a>, arXiv preprint arXiv:1406.3081, 2014
%H A135631 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F A135631 a(n) = 31*n.
%F A135631 From _G. C. Greubel_, Oct 24 2016: (Start)
%F A135631 G.f.: (31*x)/(1 - x)^2.
%F A135631 E.g.f.: 31*x*exp(x).
%F A135631 a(n) = 2*a(n-1) - a(n-2). (End)
%e A135631 a(8) = 31 * 8 = 248. a(16) = 31 * 16 = 496.
%p A135631 with(numtheory):a:=proc(n) if n=0 then 0 else mcombine(7*n,3*n,5*n,11*n) fi end: seq(a(n), n=0..45); # _Zerinvary Lajos_, Apr 11 2008
%t A135631 Range[0, 3000, 31] (* _Vladimir Joseph Stephan Orlovsky_, Jun 03 2011 *)
%t A135631 LinearRecurrence[{2,-1},{0,31},25] (* _G. C. Greubel_, Oct 24 2016 *)
%Y A135631 Cf. A135628.
%K A135631 easy,nonn
%O A135631 0,2
%A A135631 _Omar E. Pol_, Nov 25 2007