OFFSET
1,1
REFERENCES
W. H. Press et al., Numerical Recipes, Cambridge, 1986; Chapter 11.
LINKS
Georg Muntingh, Sage code for recursively computing higher entries
Eric Weisstein's World of Mathematics, Normal Matrix.
MATHEMATICA
normalQ[a_] := Block[{b=Transpose[a]}, a.b === b.a]; cnt[n_]:= Block[{c=0, q=n^2}, Do[If[normalQ@Partition[IntegerDigits[t-1, 3, q]-1, n], c++ ], {t, 3^q}]; c]; Array[cnt, 4]; - Giovanni Resta, Apr 03 2006
CROSSREFS
KEYWORD
nonn,more,hard
AUTHOR
EXTENSIONS
a(4) from Giovanni Resta, Apr 03 2006
a(5) from Georg Muntingh, Feb 03 2014
a(6) from Bert Dobbelaere, Sep 20 2020
STATUS
approved