The OEIS is supported by the many generous donors to the OEIS 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A178537 (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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Robert G. Wilson v, Table of n, a(n) for n = 0..1000 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 Cf. A000079, A000312. Sequence in context: A121140 A005057 A092634 * A084159 A046727 A283421 Adjacent sequences: A178534 A178535 A178536 * A178538 A178539 A178540 KEYWORD nonn AUTHOR Juri-Stepan Gerasimov, Dec 24 2010 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.

Last modified December 5 02:30 EST 2022. Contains 358572 sequences. (Running on oeis4.)