login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A114948 a(n) = n^2 + 10. 4
11, 14, 19, 26, 35, 46, 59, 74, 91, 110, 131, 154, 179, 206, 235, 266, 299, 334, 371, 410, 451, 494, 539, 586, 635, 686, 739, 794, 851, 910, 971, 1034, 1099, 1166, 1235, 1306, 1379, 1454, 1531, 1610, 1691, 1774, 1859, 1946, 2035, 2126, 2219, 2314, 2411, 2510 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Conjecture: n^2 + 10 != x^k for all n,x, and k>1.
The conjecture is true: See Cohn. - James Rayman, Feb 14 2023
LINKS
J. H. E. Cohn, The diophantine equation x^2 + C = y^n, Acta Arithmetica LXV.4 (1993).
FORMULA
From Amiram Eldar, Nov 02 2020: (Start)
Sum_{n>=0} 1/a(n) = (1 + sqrt(10)*Pi*coth(sqrt(10)*Pi))/20.
Sum_{n>=0} (-1)^n/a(n) = (1 + sqrt(10)*Pi*cosech(sqrt(10)*Pi))/20. (End)
From Amiram Eldar, Feb 12 2024: (Start)
Product_{n>=0} (1 - 1/a(n)) = (3/sqrt(10))*sinh(3*Pi)/sinh(sqrt(10)*Pi).
Product_{n>=0} (1 + 1/a(n)) = sqrt(11/10)*sinh(sqrt(11)*Pi)/sinh(sqrt(10)*Pi). (End)
MATHEMATICA
a[n_]:=n^2+10; a[Range[200]] (* Vladimir Joseph Stephan Orlovsky, Feb 20 2011*)
CROSSREFS
Sequence in context: A242098 A163672 A216580 * A191933 A193097 A343855
KEYWORD
easy,nonn
AUTHOR
Cino Hilliard, Feb 21 2006
EXTENSIONS
Edited by Charles R Greathouse IV, Aug 09 2010
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 15:20 EDT 2024. Contains 371916 sequences. (Running on oeis4.)