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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A154254 9n^2 - 8n + 2. 3
2, 3, 22, 59, 114, 187, 278, 387, 514, 659, 822, 1003, 1202, 1419, 1654, 1907, 2178, 2467, 2774, 3099, 3442, 3803, 4182, 4579, 4994, 5427, 5878, 6347, 6834, 7339, 7862, 8403, 8962, 9539, 10134, 10747, 11378, 12027, 12694, 13379, 14082, 14803, 15542 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

COMMENTS

The identity (81n^2+90n+26)^2-(9n^2+10n+3)*(27n+15)^2=1 can be written as A154277(n+1)^2-a(n+1)*A154267(n)^2=1. - Vincenzo Librandi, Feb 03 2012

LINKS

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

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

FORMULA

G.f.: -(2-3*x+19*x^2)/(x-1)^3. - Vincenzo Librandi, Jan 30 2012

a(n) = 3*a(n-1) -3*a(n-2) +a(n-3). - Vincenzo Librandi, Jan 30 2012

MATHEMATICA

LinearRecurrence[{3, -3, 1}, {2, 3, 22}, 50] (* Vincenzo Librandi, Jan 30 2012 *)

PROG

(PARI) a(n)=9*n^2-8*n+2 \\ Charles R Greathouse IV, Dec 27 2011

(MAGMA) I:=[2, 3, 22]; [n le 3 select I[n] else 3*Self(n-1)-3*Self(n-2)+1*Self(n-3): n in [1..50]]; // Vincenzo Librandi, Jan 29 2012

CROSSREFS

Cf. A154267, A154277.

Sequence in context: A032810 A062921 A083178 * A166122 A114996 A153256

Adjacent sequences:  A154251 A154252 A154253 * A154255 A154256 A154257

KEYWORD

nonn,easy,changed

AUTHOR

Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Jan 05 2009

EXTENSIONS

7662 replaced by 7862 - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 07 2009

Edited by Charles R Greathouse IV (charles.greathouse(AT)case.edu), Jul 25 2010

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 14 18:47 EST 2012. Contains 205663 sequences.