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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A048058 a(n) = n^2 + n + 11. 14
11, 13, 17, 23, 31, 41, 53, 67, 83, 101, 121, 143, 167, 193, 221, 251, 283, 317, 353, 391, 431, 473, 517, 563, 611, 661, 713, 767, 823, 881, 941, 1003, 1067, 1133, 1201, 1271, 1343, 1417, 1493, 1571, 1651, 1733, 1817, 1903, 1991, 2081 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

For n>4: a(n) = A176271(n+1,6). - Reinhard Zumkeller, Apr 13 2010

LINKS

Seiichi Manyama, Table of n, a(n) for n = 0..10000

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

FORMULA

a(n) = 2*n + a(n-1) (with a(0)=11). - Vincenzo Librandi, Aug 06 2010

MAPLE

with(combinat):seq(fibonacci(3, n)+n+10, n=0..45); # Zerinvary Lajos, Jun 07 2008

MATHEMATICA

f[n_]:=n^2+n+11; f[Range[0, 100]] (* Vladimir Joseph Stephan Orlovsky, Mar 12 2011*)

PROG

(PARI) a(n)=n^2+n+11 \\ Charles R Greathouse IV, Jun 29 2015

CROSSREFS

Cf. A048059, A048097, A002522.

Sequence in context: A106891 A191031 A106890 * A048059 A106076 A006489

Adjacent sequences:  A048055 A048056 A048057 * A048059 A048060 A048061

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane

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 November 22 08:46 EST 2019. Contains 329389 sequences. (Running on oeis4.)