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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A164897 4*n*(n+1)+3. 4
3, 11, 27, 51, 83, 123, 171, 227, 291, 363, 443, 531, 627, 731, 843, 963, 1091, 1227, 1371, 1523, 1683, 1851, 2027, 2211, 2403, 2603, 2811, 3027, 3251, 3483, 3723, 3971, 4227, 4491, 4763, 5043, 5331, 5627, 5931, 6243, 6563, 6891, 7227, 7571, 7923, 8283, 8651, 9027, 9411 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..900

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

FORMULA

a(n) = A000124(2*n)+A000124(2*n+1) = A069894(n)+1.

a(n+1)-a(n) = 8n+8 = A008590(n+1) (first differences).

a(n+1)-2*a(n)+a(n-1) = 8 = A010731(n) (second differences).

a(n) = 3*a(n-1)-3*a(n-2)+a(n-3). G.f.: (3+2*x+3*x^2)/(1-x)^3.

Sum[a(k), k=n+1..2*n+1]-sum[a(k), k=0..n] = (2*n+2)^3. - Bruno Berselli, Jan 24 2011

G.f.: (3+2*x+3*x^2)/(1-x)^3. [Colin Barker, Jan 09 2012]

MATHEMATICA

Table[4n(n+1)+3, {n, 0, 50}]  [From Harvey P. Dale, Jan. 23, 2011]

PROG

(MAGMA) [4*n*(n+1)+3: n in [0..50]]; // Vincenzo Librandi, Apr 24 2011

CROSSREFS

A016743.

Sequence in context: A123928 A186301 A170945 * A164845 A024194 A011941

Adjacent sequences:  A164894 A164895 A164896 * A164898 A164899 A164900

KEYWORD

nonn,easy

AUTHOR

Paul Curtz (bpcrtz(AT)free.fr), Aug 30 2009

EXTENSIONS

Definition simplified by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Sep 16 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 08:34 EST 2012. Contains 205998 sequences.