cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A178537 a(n) = (2n+1)^(2n+1) mod 2^(2n+1).

Original entry on oeis.org

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

Views

Author

Juri-Stepan Gerasimov, Dec 24 2010

Keywords

Crossrefs

Programs

  • 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*)
  • PARI
    a(n)=lift(Mod(2*n+1,2^(2*n+1))^(2*n+1)) \\ Charles R Greathouse IV, Dec 13 2016

Formula

a(n) = A000312(2n+1) mod A000079(2n+1).