login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A233448 Compositorial(n) mod n!, that is, A036691(n) mod A000142(n). 1

%I #6 Dec 21 2013 03:57:08

%S 0,0,0,0,0,0,0,0,0,0,25401600,174182400,1437004800,46942156800,

%T 301771008000,0,188305108992000,5272543051776000,30128817438720000,

%U 964122158039040000,24517325190758400000,118315866081853440000,16505063318418554880000,283958078596448256000000

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

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

%o (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

%Y Cf. A000142, A036691.

%K nonn

%O 1,11

%A _Alex Ratushnyak_, Dec 10 2013

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 11:59 EDT 2024. Contains 371254 sequences. (Running on oeis4.)