|
%I #49 Oct 17 2022 17:28:24
%S 30,31,34,39,46,55,66,79,94,111,130,151,174,199,226,255,286,319,354,
%T 391,430,471,514,559,606,655,706,759,814,871,930,991,1054,1119,1186,
%U 1255,1326,1399,1474,1551,1630,1711,1794,1879,1966,2055,2146,2239,2334,2431
%N a(n) = n^2 + 30.
%C x^2 + 30 != y^n for all x,y and n > 1, so this is a subsequence of A007916.
%C From _Bruno Berselli_, May 12 2014: (Start)
%C This is the case k=5 of the identity n^2 + k*(k+1) = ( Sum_{i=-k..k} (n+i)^3 ) / ( (2*k+1)*n ).
%C Similar sequences: A059100 (k=1), A114949 (k=2), A241748 (k=3), A241850 (k=4). (End)
%C The old name of this sequence was: Numbers of the form x^2 + 30. Also numbers that are not a perfect power.
%H Shawn A. Broyles, <a href="/A114964/b114964.txt">Table of n, a(n) for n = 0..1000</a>
%H J. H. E. Cohn, <a href="http://matwbn.icm.edu.pl/ksiazki/aa/aa65/aa6546.pdf">The diophantine equation x^2 + C = y^n</a>, Acta Arithmetica LXV.4 (1993).
%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (3,-3,1).
%F From _Amiram Eldar_, Nov 04 2020: (Start)
%F Sum_{n>=0} 1/a(n) = (1 + sqrt(30)*Pi*coth(sqrt(30)*Pi))/60.
%F Sum_{n>=0} (-1)^n/a(n) = (1 + sqrt(30)*Pi*cosech(sqrt(30)*Pi))/60. (End)
%e 11*4*a(4) = (-1)^3 + 0^3 + 1^3 + 2^3 + 3^3 + 4^3 + 5^3 + 6^3 + 7^3 + 8^3 + 9^3 = 2024. - _Bruno Berselli_, May 12 2014
%t Range[0,60]^2+30 (* _Harvey P. Dale_, Oct 17 2022 *)
%o (PARI) g(n,p) = for(x=0,n,y=x^2+p;print1(y","));
%o (PARI) a(n) = n^2 + 30; \\ _Altug Alkan_, Apr 30 2018
%Y Cf. A007916, A059100, A114949, A241748, A241850.
%K nonn,easy
%O 0,1
%A _Cino Hilliard_, Feb 21 2006
%E New name from _Shawn A. Broyles_ and _Altug Alkan_, Apr 30 2018
|
