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-1 of 1 results.

A233438 Primorial(n) mod compositorial(n), that is, A002110(n) mod A036691(n).

Original entry on oeis.org

0, 2, 6, 30, 210, 2310, 30030, 510510, 9699690, 223092870, 6469693230, 200560490130, 2153462358810, 72490129383210, 1958274892758030, 58665460642891410, 50035643372444730, 19221664375883039070, 1123712842678138983270, 27456249893723439879090, 350421246400567367415390
Offset: 0

Views

Author

Alex Ratushnyak, Dec 09 2013

Keywords

Comments

The sequence of numbers k such that a(k) > a(k+1) begins: 15, 42, 645, 805, 1566, 5430, 53698, ...

Crossrefs

Cf. A002110, A036691, A233437, A233448.

Programs

  • PARI
    a(n)=my(c,p,N);N=n;c=4;p=1;while(n>0,if(!isprime(c),p=p*c;n=n-1);c=c+1);prod(i=1,N,prime(i))%p \\ Ralf Stephan, Dec 21 2013

Formula

a(n) = A002110(n) mod A036691(n).
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.