login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A268100 a(n) = 2^((n-1) mod 2)*5*10^floor((n-1)/2). 0
1, 5, 10, 50, 100, 500, 1000, 5000, 10000, 50000, 100000, 500000, 1000000, 5000000, 10000000, 50000000, 100000000, 500000000, 1000000000, 5000000000, 10000000000, 50000000000, 100000000000, 500000000000, 1000000000000, 5000000000000, 10000000000000 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Table of n, a(n) for n=0..26.

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

FORMULA

G.f.: (1 + 5*x)/(1 - 10*x^2). - Michael De Vlieger, Jan 26 2016; amended by Georg Fischer, Apr 03 2019

MATHEMATICA

Table[2^Mod[n-1, 2]*5*10^Floor[(n-1)/2], {n, 0, 30}] (* or *)

LinearRecurrence[{0, 10}, {1, 5, 10, 50}, 30] (* or *)

CoefficientList[Series[(1+5x)/(1-10 x^2), {x, 0, 30}], x] (* Michael De Vlieger, Jan 26 2016; amended for 1, 5, ... by Georg Fischer, Apr 03 2019 *)

PROG

(PARI) a(n)=2^((n-1)%2)*5*10^((n-1)\2) \\ Georg Fischer, Apr 03 2019

(MAGMA) I:=[1, 5, 10]; [n le 3 select I[n] else 10*Self(n-2): n in [1..30]]; // Vincenzo Librandi, Jan 26 2016

CROSSREFS

Sequence in context: A270100 A271287 A003587 * A205884 A032088 A081076

Adjacent sequences:  A268097 A268098 A268099 * A268101 A268102 A268103

KEYWORD

nonn,easy

AUTHOR

M. F. Hasler, Jan 26 2016

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 22 12:56 EDT 2021. Contains 345380 sequences. (Running on oeis4.)