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!)
A261779 a(n) = ceiling((n-1)! / n). 1

%I #10 Nov 17 2019 01:43:17

%S 1,1,1,2,5,20,103,630,4480,36288,329891,3326400,36846277,444787200,

%T 5811886080,81729648000,1230752346353,19760412672000,336967037143579,

%U 6082255020441600,115852476579840000,2322315553259520000,48869596859895986087,1077167364120207360000,24817936069329577574400,596585001666576384000000

%N a(n) = ceiling((n-1)! / n).

%C Except for n = 4, this is ((n-1)!+1)/n for prime n, and (n-1)!/n otherwise.

%t Table[Ceiling[((n-1)!)/n],{n,30}] (* _Harvey P. Dale_, Oct 04 2018 *)

%o (PARI) a(n) = ceil((n-1)!/n)

%Y Cf. A007619 (prime index elements).

%K nonn

%O 1,4

%A _Franklin T. Adams-Watters_, Aug 31 2015

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 July 8 10:29 EDT 2024. Contains 374153 sequences. (Running on oeis4.)