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 A380533 #32 Jul 07 2025 10:43:56
%S A380533 0,0,2,1,5,12,16,18,22,7,3,4,40,6,46,13,29,60,66,70,36,39,41,88,12,5,
%T A380533 51,53,108,112,63,65,136,46,74,75,156,54,166,86,89,60,38,96,7,99,210,
%U A380533 111,113,228,232,34,20,125,256,262,67,135,276,56
%N A380533 a(n) is the multiplicative order of -6 modulo prime(n); a(1) = a(2) = 0 for completion.
%H A380533 Jianing Song, <a href="/A380533/b380533.txt">Table of n, a(n) for n = 1..10000</a>
%t A380533 A380533[n_] := If[n < 3, 0, MultiplicativeOrder[-6, Prime[n]]];
%t A380533 Array[A380533, 100] (* _Paolo Xausa_, Jun 29 2025 *)
%o A380533 (PARI) a(n,{k=-6}) = my(p = prime(n)); if(k%p==0, 0, znorder(Mod(k,p)))
%Y A380533 Cf. A105878 (primes having primitive root -6).
%Y A380533 Cf. bases 2..10: A014664, A062117, A082654, A211241, A211242, A211243, A211244, A211245, A002371.
%Y A380533 Cf. bases -2..-10: A337878 (if first term 1), A380482, A380531, A380532, this sequence, A380540, A380541, A380542, A385222.
%K A380533 nonn,easy
%O A380533 1,3
%A A380533 _Jianing Song_, Jun 27 2025