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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A013895 a(n) = 20^(5*n+2). 1
400, 1280000000, 4096000000000000, 13107200000000000000000, 41943040000000000000000000000, 134217728000000000000000000000000000, 429496729600000000000000000000000000000000, 1374389534720000000000000000000000000000000000000 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

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

Tanya Khovanova, Recursive Sequences

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

FORMULA

a(n) = 3200000*a(n-1), a(0)=400. - Vincenzo Librandi, May 27 2011

G.f.: -400 / (3200000*x-1). - Colin Barker, Nov 17 2015

a(n) = A009964(A016873(n)). - Wesley Ivan Hurt, Nov 17 2015

MAPLE

A013895:=n->20^(5*n+2): seq(A013895(n), n=0..10); # Wesley Ivan Hurt, Nov 17 2015

MATHEMATICA

20^(5 Range[0, 10] + 2) (* or *) CoefficientList[Series[-400/(3200000*x - 1), {x, 0, 10}], x] (* Wesley Ivan Hurt, Nov 17 2015 *)

PROG

(MAGMA) [20^(5*n+2): n in [0..10]]; // Vincenzo Librandi, May 27 2011

(PARI) Vec(-400/(3200000*x-1) + O(x^10)) \\ Colin Barker, Nov 17 2015

CROSSREFS

Cf. A009964, A016873.

Sequence in context: A197441 A268366 A013767 * A159890 A029705 A096991

Adjacent sequences:  A013892 A013893 A013894 * A013896 A013897 A013898

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane

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 June 28 05:58 EDT 2017. Contains 288813 sequences.