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.

Showing 1-2 of 2 results.

A245457 a(n) = ((prime(n)-1)!+2) mod prime(n)# (cf. A002110).

Original entry on oeis.org

1, 4, 26, 92, 2102, 23102, 60062, 510512, 29099072, 3792578792, 84106011992, 2005604901302, 252305096583542, 11561510014033982, 52331045326680122, 31359378912013061912, 1792403716245452460152, 98060777857864844592572, 3401363059422802158514832
Offset: 1

Views

Author

Vladimir Shevelev, Jul 22 2014

Keywords

Comments

Smallest positive residue modulo p_1*...*p_n (cf. A002110) of (p_n-1)!+2, where p_n=prime(n).
See comment in A245460.

Crossrefs

Programs

Extensions

More terms and simpler definition from Jens Kruse Andersen, Jul 22 2014

A245458 a(n) = ((prime(n)-2)!+2) mod prime(n)# (cf. A002110).

Original entry on oeis.org

1, 3, 8, 122, 212, 6932, 450452, 9189182, 193993802, 2677114442, 116454478142, 5415133233512, 51945166943672, 1521251317636052, 562558737261811292, 1229779565176982822, 130356633908760178922, 19227603501542126390702, 4456958491657464897364262
Offset: 1

Views

Author

Vladimir Shevelev, Jul 22 2014

Keywords

Comments

Smallest positive residue modulo p_1*...*p_n (cf. A002110) of (p_n-2)!+2, where p_n=prime(n).
See comment in A245460.

Crossrefs

Programs

  • Mathematica
    a[n_] := Mod[(Prime[n]-2)! + 2, Product[Prime[i], {i, 1, n}]];
    Array[a, 19] (* Jean-François Alcover, Dec 15 2018 *)
  • PARI
    a(n) = ((prime(n)-2)!+2) % prod(i=1, n, prime(i)) \\ Jens Kruse Andersen, Jul 22 2014

Extensions

More terms and simpler definition from Jens Kruse Andersen, Jul 22 2014
Showing 1-2 of 2 results.