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.

Showing 1-3 of 3 results.

A227867 Number of Lipschitz quaternions X such that X^2 == 1 (mod n).

Original entry on oeis.org

1, 8, 14, 32, 32, 112, 58, 32, 110, 256, 134, 448, 184, 464, 448, 32, 308, 880, 382, 1024, 812, 1072, 554, 448, 752, 1472, 974, 1856, 872, 3584, 994, 32, 1876, 2464, 1856, 3520, 1408, 3056, 2576, 1024, 1724, 6496, 1894, 4288, 3520, 4432, 2258, 448, 2746, 6016, 4312, 5888
Offset: 1

Views

Author

Keywords

Comments

A quaternion q = a + bi + cj + dk is congruent to 1 (mod n) iff a == 1 (mod n) and b == c == d == 0 (mod n).

Crossrefs

Programs

  • Mathematica
    cuaternios[n_] := Flatten[Table[{{a, -b, d, -c}, {b, a, -c, -d}, {-d, c, a, -b}, {c, d, b, a}}, {a, n}, {b, n}, {c, n}, {d, n}], 3]; invo[n_] := invo[n] = Length@Select[cuaternios[n], Mod[#.# - IdentityMatrix[4],n] == 0*# &]; Table[invo[n], {n, 1, 25}]

Extensions

More terms from Amiram Eldar, May 06 2024

A227628 Number of Lipschitz quaternions X such that X^2 == X (mod n).

Original entry on oeis.org

1, 2, 14, 2, 32, 28, 58, 2, 110, 64, 134, 28, 184, 116, 448, 2, 308, 220, 382, 64, 812, 268, 554, 28, 752, 368, 974, 116, 872, 896, 994, 2, 1876, 616, 1856, 220, 1408, 764, 2576, 64, 1724, 1624, 1894, 268, 3520, 1108, 2258, 28, 2746, 1504
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

  • Mathematica
    cuaternios[n_] := Flatten[Table[{{ a, -b, d, -c}, {b, a, -c, -d}, {-d, c, a, -b}, {c, d, b, a}}, {a, n}, {b, n}, {c, n}, {d, n}], 3]; cuater[n_] := Length@Select[cuaternios[n], Mod[#.# - #, n] == 0*# &]; Table[cuater[n],{n,1,100}]

A229292 Exponent of the group of 2 X 2 invertible matrices over Z/nZ.

Original entry on oeis.org

1, 6, 24, 30, 120, 24, 336, 126, 240, 120, 1320, 120, 2184, 336, 120, 510, 4896, 240, 6840, 120, 336, 1320, 12144, 504, 3120, 2184, 2184, 1680, 24360, 120, 29760, 2046, 1320, 4896, 1680, 240, 50616, 6840, 2184, 2520, 68880, 336, 79464, 1320, 240, 12144
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

  • Mathematica
    ex[p_, s_] := LCM[p(p^(2 s) - 1), p - 1]; ex[1] := 1; ex[n_] := {aux = 1; Do[aux = LCM[aux, ex[fa[n][[i, 1]], fa[n][[i, 2]]]], {i, 1, Length[fa[n]]}]; aux}[[1]];Table[ex[n], {n, 1, 111}]
  • PARI
    a(n)=if(n==1,return(1)); my(f=factor(n)); lcm(vector(#f~,i, f[i,1]*lcm((f[i,1]^(2*f[i,2])-1), f[i,1]-1))) \\ Charles R Greathouse IV, Nov 13 2013

Formula

a(p^s) = lcm(p*(p^(2*s) - 1), p - 1); if gcd(m,n)=1 then a(n*m) = lcm(a(n), a(m)).
Showing 1-3 of 3 results.