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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A013788 8^(4n+1). 2
8, 32768, 134217728, 549755813888, 2251799813685248, 9223372036854775808, 37778931862957161709568, 154742504910672534362390528, 633825300114114700748351602688, 2596148429267413814265248164610048, 10633823966279326983230456482242756608 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

LINKS

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

Tanya Khovanova, Recursive Sequences

FORMULA

a(n)=4096*a(n-1), n>0 ; a(0)=8 . G.f.: 8/(1-4096*x). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Dec 03 2008]

MATHEMATICA

8^(4Range[0, 20]+1)  (* From Harvey P. Dale, Apr 17 2011 *)

PROG

(MAGMA) [8^(4*n+1): n in [0..15]]; // Vincenzo Librandi, Jun 28 2011

CROSSREFS

Sequence in context: A067074 A067070 A115478 * A156178 A175855 A063374

Adjacent sequences:  A013785 A013786 A013787 * A013789 A013790 A013791

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 02:08 EST 2012. Contains 205978 sequences.