login

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”).

a(n) = 11^(n^2).
2

%I #15 Sep 08 2022 08:45:07

%S 1,11,14641,2357947691,45949729863572161,108347059433883722041830251,

%T 30912680532870672635673352936887453361,

%U 1067189571633593786424240872639621090354383081702091,4457915684525902395869512133369841539490161434991526715513934826241

%N a(n) = 11^(n^2).

%C Number of n X n matrices over GF(11).

%C a(n) = k^(n^2) with k = 2, 3, 4, ... counts n X n matrices over GF(k).

%H Vincenzo Librandi, <a href="/A076783/b076783.txt">Table of n, a(n) for n = 0..20</a>

%t 11^Range[0,10]^2 (* _Vladimir Joseph Stephan Orlovsky_, Feb 01 2012 *)

%o (Magma) [11^(n^2): n in [0..10]]; // _Vincenzo Librandi_, May 30 2011

%Y Cf. A060757, A060758, A060759, A060760, A060761.

%K nonn,easy

%O 0,2

%A Vincenzo Origlio (vincenzo.origlio(AT)itc.cnr.it), Nov 15 2002

%E More terms from _Rick L. Shepherd_, May 06 2008