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 A385226 #16 Jun 28 2025 16:04:00 %S A385226 1,5,3,11,23,29,35,41,53,27,65,83,89,45,95,113,57,119,125,131,69,155, %T A385226 39,173,179,191,209,105,43,27,221,233,239,49,251,135,281,293,299,75, %U A385226 323,329,31,177,359,183,371,9,413,207,419,431,443,455,473,485,491 %N A385226 Odd multiplicative orders of 3 modulo primes. %C A385226 a(n) is the multiplicative order of 3 modulo A385220(n). %C A385226 Odd elements in A062117. %H A385226 Jianing Song, <a href="/A385226/b385226.txt">Table of n, a(n) for n = 1..10000</a> %t A385226 Select[Map[MultiplicativeOrder[3, #] &, Prime[Range[200]]], OddQ] (* _Paolo Xausa_, Jun 28 2025 *) %o A385226 (PARI) forprime(p=2, 1e4, if(p!=3, z=znorder(Mod(3, p)); if(z%2, print1(z, ", ")))) %Y A385226 Cf. A062117, A385220 (corresponding primes). %Y A385226 Cf. other bases: A139686 (base 2), this sequence (base 3), A385227 (base 4), A385193 (base 5), A385228 (base -2), A385229 (base -3), A385230 (base -4), A385231 (base -5). %K A385226 nonn,easy %O A385226 1,2 %A A385226 _Jianing Song_, Jun 22 2025