login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A266697
Multiplicative order of 2^n mod 2*n+1.
1
1, 2, 2, 1, 3, 2, 2, 4, 1, 2, 3, 1, 5, 18, 2, 1, 5, 12, 2, 12, 1, 2, 6, 1, 7, 8, 2, 20, 9, 2, 2, 6, 3, 2, 11, 1, 1, 20, 15, 1, 27, 2, 4, 28, 1, 4, 5, 36, 1, 30, 2, 1, 3, 2, 2, 36, 1, 44, 6, 24, 11, 20, 50, 1, 7, 2, 3, 36, 1, 2, 23, 60, 7, 42, 2, 1, 6, 20, 2
OFFSET
0,2
LINKS
Eric Weisstein's World of Mathematics, Multiplicative Order
FORMULA
a(n) = A002326(n)/gcd(n,A002326(n)). - Robert Israel, Jan 10 2016
MAPLE
1, seq(numtheory:-order(2^n, 2*n+1), n=1..100); # Robert Israel, Jan 10 2016
MATHEMATICA
Table[MultiplicativeOrder[2^n, 2 n + 1], {n, 0, 100}]
PROG
(Magma) [1] cat [Modorder(2^n, 2*n+1): n in [1..100]];
(PARI) a(n) = if(n<0, 0, znorder(Mod(2^n, 2*n+1))); \\ Altug Alkan, Jan 04 2016
(GAP) List([0..100], n->OrderMod(2^n, 2*n+1)); # Muniru A Asiru, Feb 25 2019
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Vincenzo Librandi, Jan 03 2016
STATUS
approved