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.
%I A273869 #31 Jun 05 2017 23:41:32
%S A273869 3,11,14,53,110,216,322,364,389
%N A273869 Integers n such that floor(sqrt(n!)) (A055226(n)) is a prime number.
%C A273869 a(10) (if it exists) requires n > 4800.
%C A273869 No further terms <= 15000. - _Eric M. Schmidt_, Jun 05 2017
%e A273869 3 is in the sequence because floor(sqrt(3!)) = 2 is prime.
%e A273869 11 is in the sequence because floor(sqrt(11!)) = 6317 is prime.
%e A273869 14 is in the sequence because floor(sqrt(14!)) = 295259 is prime.
%e A273869 4 is not in the sequence because floor(sqrt(4!)) = 2^2.
%t A273869 Select[Table[n, {n, 1, 2500}], PrimeQ[Floor[Sqrt[#!]]] &]
%o A273869 (PARI) isok(n) = isprime(sqrtint(n!)); \\ _Michel Marcus_, Jun 10 2016
%o A273869 (PARI) lista(nn) = for(n=1, nn, if(ispseudoprime(sqrtint(n!)), print1(n, ", "))); \\ _Altug Alkan_, Jul 09 2016
%Y A273869 Cf. A055226.
%K A273869 nonn,more
%O A273869 1,1
%A A273869 _Salvador Cerdá_, Jun 01 2016