A132208 a(n) = 15*n*(n+1) + 11.

11, 41, 101, 191, 311, 461, 641, 851, 1091, 1361, 1661, 1991, 2351, 2741, 3161, 3611, 4091, 4601, 5141, 5711, 6311, 6941, 7601, 8291, 9011, 9761, 10541, 11351, 12191, 13061, 13961, 14891, 15851, 16841, 17861, 18911, 19991, 21101, 22241, 23411, 24611, 25841, 27101, 28391, 29711

Offset

0,1

Comments

The sequence starts with a string of primes for indices n = 0 to 6.

Links

Table of n, a(n) for n=0..44.

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

Formula

a(n) = 11 + 30*A000217(n). - Michel Marcus, Jun 24 2013

From Elmo R. Oliveira, Dec 28 2024: (Start)

G.f.: (11 + 8*x + 11*x^2)/(1 - x)^3.

E.g.f.: (11 + 30*x + 15*x^2)*exp(x).

a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n >= 3. (End)

Mathematica

Table[15n(n+1)+11, {n, 0, 40}] (* or *) LinearRecurrence[{3, -3, 1}, {11, 41, 101}, 40] (* Harvey P. Dale, Mar 01 2016 *)

Prog

(PARI) a(n) = 11 + 30*n*(n+1)/2 \\ Michel Marcus, Jun 24 2013

Crossrefs

Cf. A000217.

Sequence in context: A065145 A030685 A356260 * A233434 A261538 A066595

Adjacent sequences: A132205 A132206 A132207 * A132209 A132210 A132211

Keyword

nonn,easy

Author

Nate Eskey (nj.eskey09(AT)bchigh.edu), Nov 06 2007

Extensions

Better definition from R. J. Mathar, Nov 16 2007

More terms from Michel Marcus, Dec 29 2024

Status

approved