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”).

A216829
2*a(n) is the multiplicative order of 2 mod 3*(2n-1).
3
1, 3, 2, 3, 9, 5, 6, 6, 4, 9, 3, 11, 10, 27, 14, 5, 15, 6, 18, 6, 10, 7, 18, 23, 21, 12, 26, 10, 9, 29, 30, 9, 6, 33, 33, 35, 9, 30, 15, 39, 81, 41, 4, 42, 11, 6, 15, 18, 24, 45, 50, 51, 6, 53, 18, 18, 14, 22, 18, 12, 55, 30, 50, 7, 21, 65, 9, 54, 34, 69, 69
OFFSET
1,2
COMMENTS
2*a(n) is the smallest m such that 3*(2n-1) | (2^m+1).
LINKS
FORMULA
a(n) = A216833(n)/2.
MATHEMATICA
Table[MultiplicativeOrder[2, 3*(2*n-1)], {n, 100}]/2 (* T. D. Noe, Sep 19 2012 *)
PROG
(PARI) vector(100, n, znorder(Mod(2, 3*(2*n-1)))/2) \\ Joerg Arndt, Sep 14 2012.
(GAP) List([1..70], n->OrderMod(2, 3*(2*n-1))/2); # Muniru A Asiru, Feb 26 2019
CROSSREFS
KEYWORD
nonn
AUTHOR
V. Raman, Sep 17 2012
STATUS
approved