login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A013715 a(n) = 10^(2n+1). 5

%I #30 Sep 08 2022 08:44:38

%S 10,1000,100000,10000000,1000000000,100000000000,10000000000000,

%T 1000000000000000,100000000000000000,10000000000000000000,

%U 1000000000000000000000,100000000000000000000000

%N a(n) = 10^(2n+1).

%C Bisection of A011557 (powers of 10). - _Michel Marcus_, Jan 17 2016

%H Vincenzo Librandi, <a href="/A013715/b013715.txt">Table of n, a(n) for n = 0..100</a>

%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>

%H <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (100).

%F From _Philippe Deléham_, Nov 25 2008: (Start)

%F G.f.: 10/(1-100*x).

%F a(n) = 100*a(n-1), n>0; a(0)=10. (End)

%p seq(10^(2*n+1),n=0..11); # _Nathaniel Johnston_, Jun 25 2011

%t 10^(2 Range[0, 15] + 1) (* _Wesley Ivan Hurt_, Jan 17 2016 *)

%o (Magma) [10^(2*n+1): n in [0..20]]; // _Vincenzo Librandi_, Jun 26 2011

%o (PARI) a(n) = 10^(2*n+1); \\ _Michel Marcus_, Jan 17 2016

%o (PARI) Vec(10/(1-100*x) + O(x^100)) \\ _Altug Alkan_, Jan 17 2016

%Y Cf. A013708-A013714, A013716-A013729, A011557.

%K nonn,easy

%O 0,1

%A _N. J. A. Sloane_

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 13:16 EDT 2024. Contains 371951 sequences. (Running on oeis4.)