Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A005029
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A005029 13*2^n. +0
5
13, 26, 52, 104, 208, 416, 832, 1664, 3328, 6656, 13312, 26624, 53248, 106496, 212992, 425984, 851968, 1703936, 3407872, 6815744, 13631488, 27262976, 54525952, 109051904, 218103808, 436207616, 872415232, 1744830464, 3489660928 (list; graph; listen)
OFFSET

0,1

COMMENT

An autocopy sequence: its first differences are the sequence itself. - Alexandre Wajnberg & Eric Angelini (alexandre.wajnberg(AT)ulb.ac.be), Sep 07 2005

13 times powers of 2. [From Omar E. Pol (info(AT)polprimos.com), Dec 16 2008]

LINKS

Index entries for sequences related to linear recurrences with constant coefficients

Tanya Khovanova, Recursive Sequences

FORMULA

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

a(n) = A000079(n)*13. [From Omar E. Pol (info(AT)polprimos.com), Dec 16 2008]

CROSSREFS

Cf. A000079. [From Omar E. Pol (info(AT)polprimos.com), Dec 16 2008]

Sequence in context: A019551 A098961 A033897 this_sequence A041330 A041765 A041328

Adjacent sequences: A005026 A005027 A005028 this_sequence A005030 A005031 A005032

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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research