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.

A163211 Swinging Wilson quotients (A163210) which are primes.

This page as a plain text file.
%I A163211 #8 May 08 2020 17:44:09
%S A163211 3,23,71,757,30671,1383331,245273927,3362110459,107752663194272623,
%T A163211 5117886516250502670227,
%U A163211 34633371587745726679416744736000996167729085703,114326045625240879227044995173712991937709388241980425799
%N A163211 Swinging Wilson quotients (A163210) which are primes.
%C A163211 a(14)-a(18) certified prime by Primo 4.2.0. a(17) = A163210(569) = P1239, a(18) = A163210(787) = P1812. - _Charles R Greathouse IV_, Dec 11 2016
%H A163211 G. C. Greubel, <a href="/A163211/b163211.txt">Table of n, a(n) for n = 1..16</a>
%H A163211 Peter Luschny, <a href="/A180000/a180000.pdf">Die schwingende Fakultät und Orbitalsysteme</a>, August 2011.
%H A163211 Peter Luschny, <a href="http://www.luschny.de/math/primes/SwingingPrimes.html"> Swinging Primes.</a>
%e A163211 The quotient (252+1)/11 = 23 is a swinging Wilson quotient and a prime, so 23 is a member.
%p A163211 A163211 := n -> select(isprime,A163210(n));
%t A163211 sf[n_] := n!/Quotient[n, 2]!^2; a[n_] := (p = Prime[n]; (sf[p - 1] + (-1)^Floor[(p + 2)/2])/p); Select[PrimeQ][Table[a[n], {n, 1, 100}]] (* _G. C. Greubel_, Dec 10 2016 *)
%o A163211 (PARI) sf(n)=n!/(n\2)!^2
%o A163211 forprime(p=2,1e3, t=sf(p-1)\/p; if(isprime(t), print1(t", "))) \\ _Charles R Greathouse IV_, Dec 11 2016
%Y A163211 Cf. A163210, A163213, A163212, A163209, A007619.
%K A163211 nonn
%O A163211 1,1
%A A163211 _Peter Luschny_, Jul 24 2009