The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A179976 2^(2n+1) mod (2n+1). 3
 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 Adjacent sequences:  A179973 A179974 A179975 * A179977 A179978 A179979 KEYWORD nonn AUTHOR Juri-Stepan Gerasimov, Jan 13 2011 STATUS approved

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

Last modified December 4 15:36 EST 2021. Contains 349526 sequences. (Running on oeis4.)