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.

A068496 a(n) = n! reduced mod 2^n.

Original entry on oeis.org

1, 2, 6, 8, 24, 16, 48, 128, 384, 768, 1280, 3072, 3072, 10240, 22528, 32768, 98304, 196608, 65536, 262144, 262144, 1572864, 6815744, 12582912, 29360128, 25165824, 8388608, 234881024, 369098752, 335544320, 738197504, 2147483648, 6442450944, 12884901888, 4294967296
Offset: 1

Views

Author

Benoit Cloitre, Mar 11 2002

Keywords

Crossrefs

Programs

  • Mathematica
    a[n_] := Mod[n!, 2^n]; Array[a, 35] (* Amiram Eldar, Apr 26 2025 *)
  • PARI
    a(n) = n!%2^n;