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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A013833 a(n) = 4^(5*n + 4). 1
256, 262144, 268435456, 274877906944, 281474976710656, 288230376151711744, 295147905179352825856, 302231454903657293676544, 309485009821345068724781056, 316912650057057350374175801344, 324518553658426726783156020576256 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

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

Tanya Khovanova, Recursive Sequences

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

FORMULA

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

a(n) = 1024*a(n-1), n > 0; a(0)=256.

G.f.: 256/(1-1024*x).

a(n) = 4*A013832(n). (End)

PROG

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

CROSSREFS

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

Sequence in context: A118056 A185563 A220302 * A100636 A016796 A018877

Adjacent sequences:  A013830 A013831 A013832 * A013834 A013835 A013836

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 23:51 EST 2018. Contains 317275 sequences. (Running on oeis4.)