|
|
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
|
|
|
FORMULA
|
|
|
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 *)
|
|
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
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|