login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A083301 a(n) = (4*8^n + (-2)^n)/5. 3
1, 6, 52, 408, 3280, 26208, 209728, 1677696, 13421824, 107374080, 858993664, 6871947264, 54975582208, 439804649472, 3518437212160, 28147497664512, 225179981381632, 1801439850921984, 14411518807638016, 115292150460579840 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Binomial transform of A083300.

LINKS

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

Index entries for linear recurrences with constant coefficients, signature (6,16).

FORMULA

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

E.g.f.: (4*exp(8*x) + exp(-2*x))/5.

MATHEMATICA

Table[(4 * 8^n + (-2)^n)/5, {n, 0, 19}] (* Alonso del Arte, Mar 29 2011 *)

PROG

(Sage) [lucas_number1(n, 6, -16) for n in range(1, 21)] # Zerinvary Lajos, Apr 24 2009

(MAGMA) [(4*8^n+(-2)^n)/5: n in [0..25]]; // Vincenzo Librandi, Jun 29 2011

(PARI) a(n)=4^(n+1)\/5<<n \\ Charles R Greathouse IV, Jun 29 2011

CROSSREFS

Cf. A083302.

Sequence in context: A287082 A007974 A027111 * A334978 A005948 A027258

Adjacent sequences:  A083298 A083299 A083300 * A083302 A083303 A083304

KEYWORD

easy,nonn

AUTHOR

Paul Barry, Apr 24 2003

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 16 11:55 EDT 2021. Contains 348041 sequences. (Running on oeis4.)