Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A013730
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A013730 2^(3n+1). +0
6
2, 16, 128, 1024, 8192, 65536, 524288, 4194304, 33554432, 268435456, 2147483648, 17179869184, 137438953472, 1099511627776, 8796093022208, 70368744177664, 562949953421312, 4503599627370496, 36028797018963968 (list; graph; listen)
OFFSET

0,1

COMMENT

1/2 + 1/16 + 1/128 + 1/1024 + ... = 4/7 [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Aug 29 2008]

a(n) = A157176(A016921(n)) = A157176(A016933(n)). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Feb 24 2009]

LINKS

Tanya Khovanova, Recursive Sequences

FORMULA

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

PROGRAM

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

CROSSREFS

Sequence in context: A027309 A069868 A022027 this_sequence A161737 A012459 A012463

Adjacent sequences: A013727 A013728 A013729 this_sequence A013731 A013732 A013733

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research