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.

A233448 Compositorial(n) mod n!, that is, A036691(n) mod A000142(n).

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 25401600, 174182400, 1437004800, 46942156800, 301771008000, 0, 188305108992000, 5272543051776000, 30128817438720000, 964122158039040000, 24517325190758400000, 118315866081853440000, 16505063318418554880000, 283958078596448256000000
Offset: 1

Views

Author

Alex Ratushnyak, Dec 10 2013

Keywords

Comments

The sequence of numbers k such that a(k) > a(k+1) begins: 15, 81, 135, 337, 57517, ...

Crossrefs

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);p%N! \\ Ralf Stephan, Dec 21 2013