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!)
A130775 a(1) = 0; for n > 1: a(n) = 2*(prime(n)-1)!/(prime(n)+1). 0

%I #6 Sep 16 2015 12:49:07

%S 0,1,8,180,604800,68428800,2324754432000,640237370572800,

%T 93666727314800640000,20325889640780924033433600000,

%U 16578303738261941164769280000000

%N a(1) = 0; for n > 1: a(n) = 2*(prime(n)-1)!/(prime(n)+1).

%t Join[{0}, Table[2*(Prime[n] - 1)!/(Prime[n] + 1), {n, 2, 15}]] (* _Stefan Steinerberger_, Jul 16 2007 *)

%K easy,nonn

%O 1,3

%A _Giovanni Teofilatto_, Jul 14 2007

%E More terms from _Stefan Steinerberger_ and _Robert G. Wilson v_, Jul 16 2007

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 29 01:36 EDT 2024. Contains 371264 sequences. (Running on oeis4.)