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.

A182254 a(n) = primorial(n) mod n!.

Original entry on oeis.org

0, 0, 0, 0, 18, 30, 510, 1470, 22890, 284550, 3171630, 18486930, 45347610, 4254260010, 2349577230, 371965003410, 9252750236730, 190224835871070, 221717289063270, 14855058367239090, 1662934646118135390, 45974266913148043470, 4510191947325194130
Offset: 0

Views

Author

Alex Ratushnyak, Apr 21 2012

Keywords

Comments

a(n) mod 6 = 0 and a(n) mod 30 = 0, n<>4. - Gary Detlefs, May 02 2012

Examples

			a(5) = (2*3*5*7*11) mod (1*2*3*4*5) = 2310 mod 120 = 30.
		

Crossrefs

Programs

  • Mathematica
    primorial[n_] := Product[Prime[i], {i, n}]; Table[Mod[primorial[n], n!], {n, 0, 30}] (* T. D. Noe, Apr 21 2012 *)
    With[{nn=30},Join[{0},Mod[#[[2]],#[[1]]]&/@Transpose[{Range[nn]!, FoldList[ Times, Prime[Range[nn]]]}]]] (* Harvey P. Dale, May 26 2016 *)

Formula

a(n) = A002110(n) mod A000142(n).