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!)
A179976 a(n) = 2^(2n+1) mod (2n+1). 4
0, 2, 2, 2, 8, 2, 2, 8, 2, 2, 8, 2, 7, 26, 2, 2, 8, 18, 2, 8, 2, 2, 17, 2, 30, 8, 2, 43, 8, 2, 2, 8, 32, 2, 8, 2, 2, 68, 18, 2, 80, 2, 32, 8, 2, 37, 8, 13, 2, 17, 2, 2, 92, 2, 2, 8, 2, 78, 44, 60, 112, 8, 57, 2, 8, 2, 128, 53, 2, 2, 8, 85, 32, 50, 2, 2, 53, 63, 2, 8, 151 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) = A015910(2n+1).
EXAMPLE
a(0) = (2^(2*0+1) mod (2*0+1))=(2 mod 1)=0.
CROSSREFS
Sequence in context: A309574 A132697 A160689 * A137508 A055921 A029605
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 27 12:00 EDT 2024. Contains 372019 sequences. (Running on oeis4.)