The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
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
Sequence in context: A191628 A261999 A360701 * A331846 A332310 A022460
KEYWORD
nonn
AUTHOR
V. Raman, Sep 17 2012
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 31 05:54 EDT 2024. Contains 372980 sequences. (Running on oeis4.)