Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%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