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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A020729 Pisot sequences E(2,10), L(2,10), P(2,10), T(2,10). 5
2, 10, 50, 250, 1250, 6250, 31250, 156250, 781250, 3906250, 19531250, 97656250, 488281250, 2441406250, 12207031250, 61035156250, 305175781250, 1525878906250, 7629394531250, 38146972656250, 190734863281250, 953674316406250, 4768371582031250, 23841857910156250 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

REFERENCES

Shalosh B. Ekhad, N. J. A. Sloane and Doron Zeilberger, Automated Proof (or Disproof) of Linear Recurrences Satisfied by Pisot Sequences, Preprint, 2016.

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..1000

Tanya Khovanova, Recursive Sequences

Index entries for linear recurrences with constant coefficients, signature (5).

FORMULA

a(n) = 2*5^n. a(n) = 5*a(n-1).

G.f.: 2/(1-5*x). - Philippe Deléham, Nov 23 2008

MAPLE

with(finance):seq(futurevalue(2, 4, n), n=0..22); # [From Zerinvary Lajos, Mar 25 2009]

MATHEMATICA

Join[{a=2}, Table[a=5*a, {n, 0, 60}]] (* Vladimir Joseph Stephan Orlovsky, Jun 09 2011 *)

Join[{2}, NestList[5#&, 10, 30]] (* Harvey P. Dale, Jan 19 2013 *)

PROG

(MAGMA) [2*5^n: n in [0..25]]; // Vincenzo Librandi, Sep 15 2011

CROSSREFS

Essentially a duplicate of A020699. See A008776 for definitions of Pisot sequences.

Sequence in context: A015954 A015949 A020699 * A110170 A026332 A027908

Adjacent sequences:  A020726 A020727 A020728 * A020730 A020731 A020732

KEYWORD

nonn,easy

AUTHOR

David W. Wilson

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified May 23 23:53 EDT 2017. Contains 286937 sequences.