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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A013777 a(n) = 2^(4*n + 3). 3
8, 128, 2048, 32768, 524288, 8388608, 134217728, 2147483648, 34359738368, 549755813888, 8796093022208, 140737488355328, 2251799813685248, 36028797018963968, 576460752303423488, 9223372036854775808 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

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

Tanya Khovanova, Recursive Sequences

Index to divisibility sequences

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

FORMULA

From Philippe Deléham, Nov 23 2008: (Start)

a(n) = 16*a(n-1); a(0)=8.

G.f.: 8/(1-16x). (End)

PROG

(Sage) [lucas_number1(4*n, 2, 0) for n in xrange(1, 17)] # Zerinvary Lajos, Oct 27 2009

(MAGMA) [2^(4*n+3): n in [0..20]]; // Vincenzo Librandi, Jun 27 2011

(PARI) a(n)=8<<(4*n) \\ Charles R Greathouse IV, Apr 08 2012

CROSSREFS

Subsequence of A000079.

Sequence in context: A301403 A317513 A300178 * A183497 A237023 A156270

Adjacent sequences:  A013774 A013775 A013776 * A013778 A013779 A013780

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane

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 16 00:11 EST 2018. Contains 317252 sequences. (Running on oeis4.)