|
Search: id:A020714
|
|
| |
|
| 5, 10, 20, 40, 80, 160, 320, 640, 1280, 2560, 5120, 10240, 20480, 40960, 81920, 163840, 327680, 655360, 1310720, 2621440, 5242880, 10485760, 20971520, 41943040, 83886080, 167772160, 335544320, 671088640, 1342177280, 2684354560, 5368709120, 10737418240
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
Same as Pisot sequences E(5,10), L(5,10), P(5,10), T(5,10). See A008776 for definitions of Pisot sequences.
An autocopy sequence: its first differences are the sequence itself. - Alexandre Wajnberg & Eric Angelini (alexandre.wajnberg(AT)ulb.ac.be), Sep 07 2005
5 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
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 1003
|
|
FORMULA
|
a(n) = 5*2^n. a(n) = 2a(n-1).
G.F.: 5/(1-2*x)
If m is a term greater than 5 of this sequence then m=5*phi(phi(m)). - Farideh Firoozbakht (mymontain(AT)yahoo.com), Aug 16 2005
a(n) = A118416(n+1,3) for n>2. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 27 2006
a(n) = A000079(n)*5. [From Omar E. Pol (info(AT)polprimos.com), Dec 16 2008]
|
|
MAPLE
|
with(finance):seq(futurevalue(5, 1, n), n=0..31); # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 24 2009]
|
|
MATHEMATICA
|
a[n_]:=5*2^n; [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Dec 16 2008]
|
|
CROSSREFS
|
Row sums of (4, 1)-Pascal triangle A093561.
Row sums of (9, 1)-Pascal triangle A093644.
Row sums of (1, 4)-Pascal triangle A095666 (with leading 4).
Cf. A000079. [From Omar E. Pol (info(AT)polprimos.com), Dec 16 2008]
Sequence in context: A117518 A107486 A146523 this_sequence A102260 A023383 A092407
Adjacent sequences: A020711 A020712 A020713 this_sequence A020715 A020716 A020717
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
David W. Wilson (davidwwilson(AT)comcast.net)
|
|
|
Search completed in 0.002 seconds
|
