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

A178537
a(n) = (2n+1)^(2n+1) mod 2^(2n+1).
7
1, 3, 21, 119, 329, 339, 1533, 2031, 67857, 68491, 1472837, 7105255, 20933977, 91061443, 344607757, 137379807, 942687265, 22093239035, 115763405909, 23058549975, 581930881897, 8126485230643, 18131637168157, 69459897210831, 12202023051569, 1785877136688747, 4676672234192229, 4337085752026823, 51543753266508665, 431102794881380259, 338696479165696557
OFFSET
0,2
LINKS
FORMULA
a(n) = A000312(2n+1) mod A000079(2n+1).
MAPLE
A178537 := proc(n)
local o ;
o := 2*n+1 ;
modp(o &^ o, 2^o) ;
end proc: # R. J. Mathar, Oct 10 2014
MATHEMATICA
f[n_] := PowerMod[2n +1, 2n +1, 2^(2n +1)]; Array[f, 25, 0] (* Robert G. Wilson v, Dec 13 2016*)
PROG
(PARI) a(n)=lift(Mod(2*n+1, 2^(2*n+1))^(2*n+1)) \\ Charles R Greathouse IV, Dec 13 2016
CROSSREFS
Sequence in context: A121140 A005057 A092634 * A046727 A084159 A283421
KEYWORD
nonn
AUTHOR
STATUS
approved