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!)
A178970 2^(2n-1) mod (2n+1). 4
2, 3, 4, 2, 6, 7, 2, 9, 10, 2, 12, 8, 20, 15, 16, 2, 22, 19, 2, 21, 22, 38, 24, 32, 2, 27, 52, 2, 30, 31, 2, 8, 34, 2, 36, 37, 17, 43, 40, 20, 42, 8, 2, 45, 32, 2, 27, 49, 29, 51, 52, 23, 54, 55, 2, 57, 77, 11, 15, 28, 2, 108, 64, 2, 66, 32, 47, 69, 70, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
a(n) = A081294(n) mod A005408(n).
EXAMPLE
a(1)=(2^(2*1-1) mod (2*1+1))=(2^1 mod 3)=2.
MATHEMATICA
f[n_] := PowerMod[2, 2 n - 1, 2 n + 1]; Array[f, 70] (* Robert G. Wilson v, Jan 03 2011 *)
CROSSREFS
Cf. A000079.
Sequence in context: A152958 A278963 A308085 * A172054 A354985 A344005
KEYWORD
nonn
AUTHOR
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 April 24 17:29 EDT 2024. Contains 371962 sequences. (Running on oeis4.)