|
%I #20 Sep 08 2022 08:45:07
%S 1,10,10000,1000000000,10000000000000000,10000000000000000000000000,
%T 1000000000000000000000000000000000000,
%U 10000000000000000000000000000000000000000000000000,10000000000000000000000000000000000000000000000000000000000000000,1000000000000000000000000000000000000000000000000000000000000000000000000000000000
%N a(n) = 10^(n^2).
%C Number of n X n matrices over an alphabet of size 10.
%C The 10th term of this sequence is the googol (10^100).
%C The term in position 10^50 (sqrt(googol)) is the googolplex (10^googol).
%C a(n) = k^(n^2) with k = 2, 3, 4, ... counts n X n matrices over an alphabet of size k.
%H Vincenzo Librandi, <a href="/A076782/b076782.txt">Table of n, a(n) for n = 0..20</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Googol.html">Googol</a>, <a href="http://mathworld.wolfram.com/Googolplex.html">Googolplex</a>
%t 10^Range[0,10]^2 (* _Vladimir Joseph Stephan Orlovsky_, Feb 01 2012 *)
%o (Magma) [10^(n^2): n in [0..10]]; // _Vincenzo Librandi_, May 30 2011
%o (Maxima) A076782(n):=10^(n^2)$
%o makelist(A076782(n),n,0,10); /* _Martin Ettl_, Nov 08 2012 */
%Y Cf. A060757, A060758, A060759, A060760, A060761.
%K nonn
%O 0,2
%A Vincenzo Origlio (vincenzo.origlio(AT)itc.cnr.it), Nov 15 2002
| 