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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A013825 a(n) = 2^(5*n + 4). 1
16, 512, 16384, 524288, 16777216, 536870912, 17179869184, 549755813888, 17592186044416, 562949953421312, 18014398509481984, 576460752303423488, 18446744073709551616, 590295810358705651712, 18889465931478580854784 (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 entries for linear recurrences with constant coefficients, signature (32).

FORMULA

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

a(n) = 32*a(n-1), n > 0; a(0)=16.

G.f.: 16/(1-32*x).

a(n) = 16*A009976(n). (End)

MATHEMATICA

2^(5*Range[0, 20] + 4) (* or *) NestList[32#&, 16, 20] (* Harvey P. Dale, Sep 27 2015 *)

PROG

(MAGMA) [2^(5*n+4): n in [0..15]]; // Vincenzo Librandi, Jul 07 2011

CROSSREFS

Cf. A000079 (2^n), A016897 (5*n+4).

Sequence in context: A303424 A317514 A300179 * A099772 A041483 A041480

Adjacent sequences:  A013822 A013823 A013824 * A013826 A013827 A013828

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 19 19:13 EST 2018. Contains 317364 sequences. (Running on oeis4.)