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

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A147296 n*(9*n+2). 4
0, 11, 40, 87, 152, 235, 336, 455, 592, 747, 920, 1111, 1320, 1547, 1792, 2055, 2336, 2635, 2952, 3287, 3640, 4011, 4400, 4807, 5232, 5675, 6136, 6615, 7112, 7627, 8160, 8711, 9280, 9867, 10472, 11095, 11736, 12395, 13072, 13767, 14480, 15211, 15960 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

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

Reply to V. Librandi, A147296 (SeqFan list) - M. F. Hasler, Mar 01 2009

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

FORMULA

a(n) = n*(9*n + 2), as conjectured by V. Librandi. - From M. F. Hasler, Mar 01 2009

G.f.: x*(11+7*x)/(1-x)^3. - Jaume Oliver Lafont, Aug 30 2009

a(n) = floor((3*n + 1/3)^2). - Reinhard Zumkeller, Apr 14 2010

MATHEMATICA

Table[n(9n+2), {n, 0, 50}] (* or *) LinearRecurrence[{3, -3, 1}, {0, 11, 40}, 50] (* Harvey P. Dale, Dec 19 2014 *)

PROG

(PARI) A147296(n) = n*(9*n + 2) - M. F. Hasler, Mar 01 2009

CROSSREFS

Equals first 9-fold decimation of A144454.

Cf. A010701, A017173, A185019.

Sequence in context: A077568 A122014 A031427 * A059142 A064798 A056124

Adjacent sequences:  A147293 A147294 A147295 * A147297 A147298 A147299

KEYWORD

nonn,easy

AUTHOR

Paul Curtz, Nov 05 2008

EXTENSIONS

More terms from M. F. Hasler, Mar 01 2009

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

License Agreements, Terms of Use, Privacy Policy .

Last modified November 19 16:10 EST 2017. Contains 294936 sequences.