cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A028673 Galois numbers for p=11; order of group AGL(n,11).

This page as a plain text file.
%I A028673 #14 Jul 12 2025 08:32:11
%S A028673 1,110,1597200,2827411356000,606039338269189440000,
%T A028673 15719002038355567350156912000000,
%U A028673 49332934203739383347738694321468865920000000,18734172592683683919731709047397914403374452828934400000000,860830165835516295815608223447061872667128267986790628055380728832000000000
%N A028673 Galois numbers for p=11; order of group AGL(n,11).
%H A028673 Vincenzo Librandi, <a href="/A028673/b028673.txt">Table of n, a(n) for n = 0..30</a>
%H A028673 <a href="/index/Gre#groups">Index entries for sequences related to groups</a>.
%F A028673 a(n) = 11^n * Product_{k=0..n-1} (11^n - 11^k).
%F A028673 a(n) ~ c * 11^(n^2+n), where c = A132267. - _Amiram Eldar_, Jul 12 2025
%t A028673 FoldList[ #1*11^#2 (11^#2-1)&, 1, Range[ 20 ] ]
%t A028673 a[n_] := 11^n * Product[11^n - 11^k, {k, 0, n-1}]; Array[a, 10, 0] (* _Amiram Eldar_, Jul 12 2025 *)
%o A028673 (PARI) a(n) = 11^n * prod(k = 0, n-1, 11^n - 11^k); \\ _Amiram Eldar_, Jul 12 2025
%Y A028673 Cf. A028365, A028665, A028667, A028669, A028675, A028679, A028681, A028685.
%Y A028673 Cf. A132267.
%K A028673 nonn
%O A028673 0,2
%A A028673 _Olivier Gérard_