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.

This page as a plain text file.
%I A068496 #15 Apr 26 2025 08:27:38
%S A068496 1,2,6,8,24,16,48,128,384,768,1280,3072,3072,10240,22528,32768,98304,
%T A068496 196608,65536,262144,262144,1572864,6815744,12582912,29360128,
%U A068496 25165824,8388608,234881024,369098752,335544320,738197504,2147483648,6442450944,12884901888,4294967296
%N A068496 a(n) = n! reduced mod 2^n.
%H A068496 Amiram Eldar, <a href="/A068496/b068496.txt">Table of n, a(n) for n = 1..1000</a>
%t A068496 a[n_] := Mod[n!, 2^n]; Array[a, 35] (* _Amiram Eldar_, Apr 26 2025 *)
%o A068496 (PARI) a(n) = n!%2^n;
%Y A068496 Cf. A000079, A000142.
%K A068496 nonn
%O A068496 1,2
%A A068496 _Benoit Cloitre_, Mar 11 2002