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!)
A242766 a(n) = floor(sqrt(n!+1)). 1

%I #26 Sep 16 2022 13:04:54

%S 1,1,1,2,5,11,26,71,200,602,1904,6317,21886,78911,295259,1143535,

%T 4574143,18859677,80014834,348776576,1559776268,7147792818,

%U 33526120082,160785623545,787685471322,3938427356614,20082117944245,104349745809073,552166953567228

%N a(n) = floor(sqrt(n!+1)).

%H Vincenzo Librandi, <a href="/A242766/b242766.txt">Table of n, a(n) for n = 0..199</a>

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Brocard%27s_problem">Brocard's problem</a>

%t Table[Floor[Sqrt[n! + 1]], {n, 0, 30}]

%o (Magma) [Floor(Sqrt(Factorial(n)+1)): n in [0..30]];

%o (PARI) a(n)={sqrtint(n!+1)} \\ _Andrew Howroyd_, Jan 17 2018

%Y Cf. A163524.

%K nonn

%O 0,4

%A _Vincenzo Librandi_, May 29 2014

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 September 9 20:10 EDT 2024. Contains 375765 sequences. (Running on oeis4.)