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.
%I A286397 #38 Apr 15 2021 17:02:05
%S A286397 1,10,1540,125512750,1250002537502500,1250000000501250002500000,
%T A286397 125000000000000250375000000250000000,
%U A286397 1250000000000000000005001250000000002500000000000
%N A286397 Number of inequivalent n X n matrices over an alphabet of size 10 under action of dihedral group of the square D_4.
%C A286397 Burnside's orbit-counting lemma.
%H A286397 María Merino, <a href="/A286397/b286397.txt">Table of n, a(n) for n = 0..20</a>
%H A286397 M. Merino and I. Unanue, <a href="https://doi.org/10.1387/ekaia.17851">Counting squared grid patterns with Pólya Theory</a>, EKAIA, 34 (2018), 289-316 (in Basque).
%F A286397 a(n) = (1/8)*(10^(n^2) + 2*10^(n^2/4) + 3*10^(n^2/2) + 2*10^((n^2 + n)/2)) if n is even;
%F A286397 a(n) = (1/8)*(10^(n^2) + 2*10^((n^2 + 3)/4) + 10^((n^2 + 1)/2) + 4*10^((n^2 + n)/2)) if n is odd.
%t A286397 Table[1/8*(10^(n^2) + 2*10^((n^2 + 3 #)/4) + (3 - 2 #)*10^((n^2 + #)/2) + (2 + 2 #)*10^((n^2 + n)/2)) &@ Boole@ OddQ@ n, {n, 7}] (* _Michael De Vlieger_, May 12 2017 *)
%Y A286397 Column k=10 of A343097.
%Y A286397 Cf. A054247, A054739, A054751, A054752, A286392, A286393, A286394, A286395.
%K A286397 nonn
%O A286397 0,2
%A A286397 _María Merino_, Imanol Unanue, _Yosu Yurramendi_, May 08 2017