Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #43 Sep 27 2024 05:37:51
%S 0,3,22,57,108,175,258,357,472,603,750,913,1092,1287,1498,1725,1968,
%T 2227,2502,2793,3100,3423,3762,4117,4488,4875,5278,5697,6132,6583,
%U 7050,7533,8032,8547,9078,9625,10188,10767,11362,11973,12600
%N a(n) = n*(8*n-5).
%C Sequence found by reading the line from 0, in the direction 0, 3, ..., in the square spiral whose vertices are the triangular numbers A000217. Opposite numbers to the members of A139276 in the same spiral.
%H G. C. Greubel, <a href="/A139272/b139272.txt">Table of n, a(n) for n = 0..5000</a>
%H Omar E. Pol, <a href="http://www.polprimos.com">Determinacion geometrica de los numeros primos y perfectos</a>.
%H Franck Ramaharo, <a href="https://arxiv.org/abs/1802.07701">Statistics on some classes of knot shadows</a>, arXiv:1802.07701 [math.CO], 2018.
%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (3,-3,1).
%F a(n) = 8*n^2 - 5*n.
%F Sequences of the form a(n) = 8*n^2 + c*n have generating functions x{c+8+(8-c)x} / (1-x)^3 and recurrence a(n) = 3a(n-1) - 3a(n-2) + a(n-3). The inverse binomial transform is 0, c+8, 16, 0, 0, ... (0 continued). This applies to A139271-A139278, positive or negative c. - _R. J. Mathar_, May 12 2008
%F a(n) = 16*n + a(n-1) - 13 with n>0, a(0)=0. - _Vincenzo Librandi_, Aug 03 2010
%F From _G. C. Greubel_, Jul 18 2017: (Start)
%F a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3).
%F G.f.: x*(13*x + 3)/(1-x)^3.
%F E.g.f.: (8*x^2 + 3*x)*exp(x). (End)
%F Sum_{n>=1} 1/a(n) = ((sqrt(2)-1)*Pi + 8*log(2) - 2*sqrt(2)*log(sqrt(2)+1))/10. - _Amiram Eldar_, Mar 17 2022
%t s=0;lst={s};Do[s+=n++ +3;AppendTo[lst, s], {n, 0, 7!, 16}];lst (* _Vladimir Joseph Stephan Orlovsky_, Nov 16 2008 *)
%t Table[n*(8*n -5), {n,0,50}] (* _G. C. Greubel_, Jul 18 2017 *)
%t LinearRecurrence[{3,-3,1},{0,3,22},50] (* _Harvey P. Dale_, Jan 13 2024 *)
%o (PARI) a(n)=n*(8*n-5) \\ _Charles R Greathouse IV_, Oct 07 2015
%Y Cf. A000217, A014634, A014635, A033585, A033586, A033587, A035008, A051870, A069129, A085250, A072279, A139273, A139274, A139275, A139276, A139278, A139279, A139280, A139281, A139282.
%Y Cf. numbers of the form n*(n*k-k+6)/2, this sequence is the case k=16: see Comments lines of A226492.
%K nonn,easy
%O 0,2
%A _Omar E. Pol_, Apr 26 2008