|
%I #11 Oct 02 2023 16:57:33
%S 1,1108,1494212,1337096139435608276,3419285040690464059059891892,
%T 360915376914019980818136688390244,
%U 4539578056760982039383691063124612231245283018868,1281586150064588021396889740995557733625358136974688524590164
%N Let p be a prime of the form 4k+1; sequence gives (q!^2 + 4)/p where q = (p-3)/2.
%H Harry J. Smith, <a href="/A066163/b066163.txt">Table of n, a(n) for n = 1..30</a>
%H Ed Pegg Jr., <a href="http://www.mathpuzzle.com">Math. Puzzles</a>
%o (PARI) { n=0; for (m=1, 10^9, p=prime(m); if (frac((p - 1)/4) == 0, q = (p - 3)/2; write("b066163.txt", n++, " ", (q!^2 + 4)/p); if (n==30, return)) ) } \\ _Harry J. Smith_, Feb 03 2010
%Y Cf. A002144.
%K nonn
%O 1,2
%A _N. J. A. Sloane_, Dec 13 2001
| 