login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A114948 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.

LINKS

Table of n, a(n) for n=1..50.

Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

FORMULA

a(n)=2*n+a(n-1)-1 (with a(1)=11) - Vincenzo Librandi, Nov 13 2010

MATHEMATICA

f[n_]:=n^2+10; f[Range[200]] (* Vladimir Joseph Stephan Orlovsky, Feb 20 2011*)

PROG

(PARI) g(n, p) = for(x=1, n, y=x^2+p; print1(y", "))

CROSSREFS

Sequence in context: A242098 A163672 A216580 * A191933 A193097 A077675

Adjacent sequences:  A114945 A114946 A114947 * A114949 A114950 A114951

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 12 17:33 EST 2019. Contains 329960 sequences. (Running on oeis4.)