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

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
OFFSET
0,2
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