Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A087202
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A087202
%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,107,
%U A087202 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. For 1 < n < 630,a(n) is prime,I guess for n > 1,a(n) 
               (compare the conjecture about A037153) is prime.
%F 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)
%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.
%Y A087202 Sequence in context: A088298 A075992 A022294 this_sequence A010666 A164515 
               A047494
%Y A087202 Adjacent sequences: A087199 A087200 A087201 this_sequence A087203 A087204 
               A087205
%K A087202 easy,nonn
%O A087202 1,1
%A A087202 Farideh Firoozbakht (mymontain(AT)yahoo.com), Sep 01 2003

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research