login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A135466 a(n) = (2*n-8)^2 * 2^(n-3). 1
8, 9, 8, 4, 0, 16, 128, 576, 2048, 6400, 18432, 50176, 131072, 331776, 819200, 1982464, 4718592, 11075584, 25690112, 58982400, 134217728, 303038464, 679477248, 1514143744, 3355443200, 7398752256, 16240345088, 35500589056, 77309411328, 167772160000 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
G. Myerson and A. J. van der Poorten, Some problems concerning recurrence sequences, Amer. Math. Monthly 102 (1995), no. 8, 698-705.
FORMULA
O.g.f.: -(8-39*x+50*x^2)/(-1+2*x)^3 . - R. J. Mathar, Feb 08 2008
From G. C. Greubel, Oct 14 2016: (Start)
a(n) = 6*a(n-1) - 12*a(n-2) + 8*a(n-3).
E.g.f.: (2*x^2 - 7*x + 8)*exp(2*x). (End)
MATHEMATICA
Table[(2*n - 8)^2 * 2^(n - 3), {n, 0, 25}] (* or *) LinearRecurrence[{6, -12, 8}, {8, 9, 8}, 25] (* G. C. Greubel, Oct 14 2016 *)
PROG
(PARI) a(n)=(n-4)^2*2^(n-1) \\ Charles R Greathouse IV, Oct 14 2016
CROSSREFS
Sequence in context: A153202 A019738 A236098 * A265296 A230154 A338856
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Feb 07 2008
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 17:39 EDT 2024. Contains 371797 sequences. (Running on oeis4.)