The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A209411 Number of 2 x 2 matrices M such that M*transpose(M) == 0 mod n. 3

%I

%S 1,4,1,16,49,4,1,64,81,196,1,16,337,4,49,256,577,324,1,784,1,4,1,64,

%T 1825,1348,81,16,1681,196,1,1024,1,2308,49,1296,2737,4,337,3136,3361,

%U 4,1,16,3969,4,1,256,2401,7300,577,5392,5617,324,49,64,1

%N Number of 2 x 2 matrices M such that M*transpose(M) == 0 mod n.

%H Joerg Arndt, <a href="/A209411/b209411.txt">Table of n, a(n) for n = 1..500</a>

%t gg[n_] := gg[n] = Flatten[Table[{{x, y}, {z, t}}, {x, n}, {y, n}, {t, n}, {z, n}], 3]; nil[n_] := nil[n] = Length@gg[n][[Select[Range[Length[gg[n]]], Mod[gg[n][[#]].Transpose[gg[n][[#]]], n] == {{0, 0}, {0, 0}} &]]]; Table[Print[nil[n]]; nil[n], {n, 1, 22}]

%Y Cf. A182039.

%K nonn,mult

%O 1,2

%A _José María Grau Ribas_, Mar 08 2012

%E Keyword:mult added by _Andrew Howroyd_, Aug 02 2018

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 9 05:12 EDT 2020. Contains 336319 sequences. (Running on oeis4.)