login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A110288 a(n) = 19*2^n. 6
19, 38, 76, 152, 304, 608, 1216, 2432, 4864, 9728, 19456, 38912, 77824, 155648, 311296, 622592, 1245184, 2490368, 4980736, 9961472, 19922944, 39845888, 79691776, 159383552, 318767104, 637534208, 1275068416, 2550136832, 5100273664, 10200547328, 20401094656 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
The first differences are the sequence itself. Doubling the terms gives the same sequence (beginning one step further).
19 times powers of 2. - Omar E. Pol, Dec 17 2008
LINKS
Tanya Khovanova, Recursive Sequences
FORMULA
G.f.: 19/(1-2*x). - Philippe Deléham, Nov 23 2008
a(n) = A000079(n)*19. - Omar E. Pol, Dec 17 2008
E.g.f.: 19*exp(2*x). - G. C. Greubel, Jan 04 2023
MATHEMATICA
19*2^Range[0, 60] (* Vladimir Joseph Stephan Orlovsky, Jun 09 2011 *)
NestList[2#&, 19, 30] (* Harvey P. Dale, May 11 2018 *)
PROG
(Magma) [19*2^n: n in [0..40]]; // Vincenzo Librandi, Apr 28 2011
(SageMath) [19*2^n for n in range(41)] # G. C. Greubel, Jan 04 2023
CROSSREFS
Sequences of the form (2*m+1)*2^n: A000079 (m=0), A007283 (m=1), A020714 (m=2), A005009 (m=3), A005010 (m=4), A005015 (m=5), A005029 (m=6), A110286 (m=7), A110287 (m=8), this sequence (m=9), A175805 (m=10), A248646 (m=11), A164161 (m=12), A175806 (m=13), A257548 (m=15).
Sequence in context: A048844 A008601 A033900 * A318260 A050813 A041712
KEYWORD
easy,nonn
AUTHOR
Alexandre Wajnberg, Sep 07 2005
EXTENSIONS
Edited by Omar E. Pol, Dec 16 2008
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)