cp's OEIS Frontend

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.

A076199 a(n) equals the least s>0 such that n!! + s^2 is prime.

This page as a plain text file.
%I A076199 #6 Aug 04 2014 11:27:12
%S A076199 1,1,2,3,2,5,2,5,8,7,2,19,4,17,58,11,2,17,8,31,32,17,8,13,4,23,4,23,2,
%T A076199 53,86,37,32,23,164,79,86,23,2,229,94,89,2,89,4,83,4,149,134,31,8,83,
%U A076199 4,53,206,227,206,283,64,43,274,37,128,263,214,163,146,167,326,157,178
%N A076199 a(n) equals the least s>0 such that n!! + s^2 is prime.
%t A076199 sp[n_]:=Module[{np=NextPrime[n]},While[!IntegerQ[Sqrt[np-n]],np = NextPrime[ np]];Sqrt[np-n]]; sp/@(Range[80]!!) (* _Harvey P. Dale_, Aug 04 2014 *)
%Y A076199 Cf. A057019.
%K A076199 nonn
%O A076199 1,3
%A A076199 _Zak Seidov_, Nov 02 2002