|
%I #36 Feb 11 2023 02:32:18
%S 1,1000,1000000,1000000000,1000000000000,1000000000000000,
%T 1000000000000000000,1000000000000000000000,1000000000000000000000000,
%U 1000000000000000000000000000,1000000000000000000000000000000
%N Powers of one thousand which are described by single words in dated British English usage, extended by using "-ard" beyond 10^9.
%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/NonRecursions.html">Non Recursions</a>
%H <a href="/A060365/a060365.txt">More information about A060365 and A060366.</a>
%F a(n) = 10^(3*(n-1)).
%e 10^0 = one, 10^3 = thousand, 10^6 = million, 10^9 = milliard, 10^12 = billion, etc.
%p A060366:=n->10^(3*(n-1)): seq(A060366(n), n=1..15); # _Wesley Ivan Hurt_, Jan 21 2016
%t 10^(3 Range[0, 10]) (* or *) Table[10^(3 (n - 1)), {n, 15}] (* _Wesley Ivan Hurt_, Jan 21 2016 *)
%o (Magma) [10^(3*(n-1)) : n in [1..15]]; // _Wesley Ivan Hurt_, Jan 21 2016
%Y Cf. A060365.
%K easy,fini,nonn,word
%O 1,2
%A _Gerard Schildberger_
%E Description changed by _Ivan Panchenko_, Nov 10 2019
|
