|
%I #30 Jan 28 2016 05:39:32
%S 10,9,60,90,70,66,96,10000000000,10000000000000,
%T 10000000000000000000000000000000000,10000000000000000000000000,
%U 10000000000000000000000000000000000000,10000000000000000000000000000000000000000000000000000000000000000,9000000000000000000000000000000000000000000000000000000000000000
%N Largest natural number less than 10^66 requiring exactly n letters in English.
%C This uses US nomenclature: no conjunctive 'and'; 10^10 = 'ten billion'.
%C This is the 'largest' counterpart to A080777, which gives the smallest positive integer with exactly n letters.
%C Because of the definition's size limitation, a(758) will be the largest term in this finite sequence; a(758) = 878878878878878878878878878878878878878878878878878878878878878878.
%H Hans Havermann, <a href="/A052196/b052196.txt">Table of n, a(n) for n = 3..758</a>
%H Hans Havermann, <a href="http://chesswanks.com/seq/a052196.html">Growth illustration for this sequence</a>
%H Hans Havermann, <a href="http://gladhoboexpress.blogspot.ca/2013/11/define-divide-and-conquer_10.html">Define, divide, and conquer</a>
%H Pegg, E. Jr. and Weisstein, E. W. <a href="http://mathworld.wolfram.com/news/2004-10-13/google/">Mathematica's Google Aptitude: problem #20</a> MathWorld Headline news, Oct 13, 2004.
%e The largest numbers (<10^66) using 10 to 15 letters:
%e 10: 10*10^9 = ten billion
%e 11: 10*10^12 = ten trillion
%e 12: 10*10^33 = ten decillion
%e 13: 10*10^24 = ten septillion
%e 14: 10*10^36 = ten undecillion
%e 15: 10*10^63 = ten vigintillion
%t k=100;lst=StringLength/@StringReplace[IntegerName/@Range[k],
%t {"-"-> ""," "-> ""}];max[n_]:=Last[Position[lst,n]];
%t max/@Range[3,9]//Flatten (* _Ivan N. Ianakiev_, Oct 07 2015 *)
%Y Cf. A001166, A080777.
%K nonn,word,fini,full
%O 3,1
%A _Henry Bottomley_, Jan 28 2000
%E a(11) from _Brian Galebach_, Feb 06 2004
%E Edited and extended by _Hans Havermann_, Nov 08 2013
| 