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 A139610 #22 Apr 16 2024 10:26:13
%S A139610 10,55,100,145,190,235,280,325,370,415,460,505,550,595,640,685,730,
%T A139610 775,820,865,910,955,1000,1045,1090,1135,1180,1225,1270,1315,1360,
%U A139610 1405,1450,1495,1540,1585,1630,1675,1720,1765,1810,1855,1900
%N A139610 a(n) = 45*n + 10.
%C A139610 Numbers of the 10th column of positive numbers in the square array of nonnegative and polygonal numbers A139600.
%H A139610 Vincenzo Librandi, <a href="/A139610/b139610.txt">Table of n, a(n) for n = 0..5000</a>
%H A139610 <a href="/index/Pol#polygonal_numbers">Index to sequences related to polygonal numbers</a>
%H A139610 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F A139610 a(n) = A057145(n+2,10).
%F A139610 G.f.: 5*(2+7*x)/(x-1)^2. - _R. J. Mathar_, Jul 28 2016
%F A139610 From _Elmo R. Oliveira_, Apr 16 2024: (Start)
%F A139610 E.g.f.: 5*exp(x)*(2 + 9*x).
%F A139610 a(n) = 5*A017185(n) = 5*(A062708(n+1) - A062708(n)).
%F A139610 a(n) = 2*a(n-1) - a(n-2) for n >= 2. (End)
%t A139610 45*Range[0,50]+10 (* or *) LinearRecurrence[{2,-1},{10,55},50] (* _Harvey P. Dale_, Dec 27 2021 *)
%o A139610 (Magma) [5*(9*n + 2): n in [0..60]]; // _Vincenzo Librandi_, Jul 23 2011
%o A139610 (PARI) a(n)=45*n+10 \\ _Charles R Greathouse IV_, Oct 05 2011
%Y A139610 Cf. A017185, A057145, A062708, A139600.
%K A139610 easy,nonn
%O A139610 0,1
%A A139610 _Omar E. Pol_, Apr 27 2008