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.

A087202 a(n) is the smallest m such that m > A037153(n) and n!+ m is prime.

This page as a plain text file.
%I A087202 #8 Mar 30 2012 17:37:41
%S A087202 4,5,7,7,11,13,19,31,23,19,19,43,73,41,149,41,53,61,109,37,37,71,109,
%T A087202 193,97,173,59,101,229,163,241,83,139,103,83,577,397,47,269,61,211,
%U A087202 107,97,89,379,149,269,83,137,167,281,89,79,443,229,157,179,563,389,277
%N A087202 a(n) is the smallest m such that m > A037153(n) and n!+ m is prime.
%C A087202 a(n) is the second m (first m is A037153(n)) such that m > 1 and n!+ m is prime.
%C A087202 Conjecture: For n > 1, a(n) is prime (compare the conjecture about A037153).
%C A087202 Conjecture holds through 1200 terms.
%H A087202 Ray Chandler, <a href="/A087202/b087202.txt">Table of n, a(n) for n=1..1200</a>
%t A087202 A037153[n_] := (For[m=Prime[PrimePi[n]+1], !PrimeQ[n!+m], m++ ]; m); a[n_] := (For[m=A037153[n]+1, !PrimeQ[n!+m], m++ ]; m); Table[a[n], {n, 60}]
%Y A087202 Cf. A037153, A005235, A087200.
%K A087202 nonn
%O A087202 1,1
%A A087202 _Farideh Firoozbakht_, Sep 01 2003
%E A087202 Edited by _Ray Chandler_, Mar 08 2010