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.

A216441 a(n) = n! mod !n.

Original entry on oeis.org

0, 0, 6, 32, 190, 1332, 10654, 95888, 958878, 10547660, 126571918, 1645434936, 23036089102, 345541336532, 5528661384510, 93987243536672, 1691770383660094, 32143637289541788, 642872745790835758, 13500327661607550920, 297007208555366120238, 6831165796773420765476
Offset: 2

Views

Author

Michel Lagneau, Sep 07 2012

Keywords

Comments

!n is a subfactorial number (A000166).

Examples

			a(5) = 5! mod !5 = 120 mod 44 = 32. - _Indranil Ghosh_, Feb 15 2017
		

Crossrefs

Programs

  • Maple
    with(numtheory): f:=n->sum(n!*(((-1)^k)*1/k!), k=0..n):for n from 1 to 30 do:  x:=irem(n!,f(n)): printf(`%d, `, x):od:
  • Mathematica
    Table[Mod[n !, Subfactorial[n]],{n,100} ]