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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A013777 2^(4n+3). 2
8, 128, 2048, 32768, 524288, 8388608, 134217728, 2147483648, 34359738368, 549755813888, 8796093022208, 140737488355328, 2251799813685248, 36028797018963968, 576460752303423488, 9223372036854775808 (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)=16*a(n-1), n>0 ; a(0)=8 . G.f.: 8/(1-16x). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 23 2008]

PROG

(Other) sage: [lucas_number1(4*n, 2, 0) for n in xrange(1, 17)] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Oct 27 2009]

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

CROSSREFS

Sequence in context: A105094 A036294 A133680 * A183497 A156270 A051189

Adjacent sequences:  A013774 A013775 A013776 * A013778 A013779 A013780

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 13:28 EST 2012. Contains 206031 sequences.