[go: up one dir, main page]

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!)
A252707 "Smallest interesting" sequence such that each term has as many digits as the previous term's value. 1

%I #18 Jun 20 2017 13:16:31

%S 2,10,1000000000

%N "Smallest interesting" sequence such that each term has as many digits as the previous term's value.

%C Using 2 as the first term yields the "smallest interesting" sequence with this property. Starting with the value 1 yields the sequence 1, 1, 1, ... and starting with 3 yields a sequence that grows faster (3, 100, 10^99, ...).

%C The next term is too large to include. - _N. J. A. Sloane_, Jun 20 2017

%F a(1) = 2, a(n) = 10^(a(n-1) - 1).

%t RecurrenceTable[{a[n] == 10^(a[n - 1] - 1), a[1] == 2}, a, {n, 3}] (* _Michael De Vlieger_, Mar 24 2015 *)

%Y See A288848 for a variation.

%K nonn,bref,base

%O 1,1

%A _Oliver Wong_, Mar 22 2015

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 August 31 03:15 EDT 2024. Contains 375550 sequences. (Running on oeis4.)