Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A087203
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A087203
%S A087203 4,7,11,19,19,37,17,17,17,17,61,43,59,71,61,43,113,71,41,101,191,103,
%T A087203 191,179,71,127,37,97,113,373,71,373,293,157,149,241,167,211,151,89,131,
%U A087203 113,73,107,179,227,173,113,257,239,151,227,163,509,293,347,643,373,457
%N A087203 a(n) is the smallest m such that m > A037155(n) and n!- m is prime.
%C A087203 a(1) and a(2) are not defined. a(n) is the second m (first m is A037155(n)) 
               such that m > 1 and n!- m is prime.For 3 < n < 643,a(n) is prime. 
               I guess (compare the conjecture about A087202) except for the first 
               term, every term of this sequence is prime.
%F A087203 A037155[3]=3; A037155[n_] := (For[m=Prime[PrimePi[n]+1], !PrimeQ[n!-m], 
               m++ ]; m); a[n_] := (For[m=A037155[n]+1, !PrimeQ[n!-m], m++ ]; m)
%t A087203 A037155[3]=3; A037155[n_] := (For[m=Prime[PrimePi[n]+1], !PrimeQ[n!-m], 
               m++ ]; m); a[n_] := (For[m=A037155[n]+1, !PrimeQ[n!-m], m++ ]; m); 
               Table[a[n], {n, 3, 62}]
%Y A087203 Cf. A037155, A087201, A087202.
%Y A087203 Sequence in context: A023666 A023502 A024882 this_sequence A109328 A083839 
               A091176
%Y A087203 Adjacent sequences: A087200 A087201 A087202 this_sequence A087204 A087205 
               A087206
%K A087203 nonn
%O A087203 3,1
%A A087203 Farideh Firoozbakht (mymontain(AT)yahoo.com), Sep 01 2003

    
page 1

Search completed in 0.001 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 December 17 19:39 EST 2009. Contains 170821 sequences.


AT&T Labs Research