Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A097444
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A097444
%S A097444 7,13,41,227,2339,30059,510551,9699727,223092917,6469693319,
%T A097444 200560490213,7420738134911,304250263527317,13082761331670097,
%U A097444 614889782588491519,32589158477190044803,1922760350154212639159
%N A097444 Second occurrence where n# + p is prime for primes p = 3,5,...
%C A097444 Care has to be taken to start with a large enough n to be sure terms 
               are not missed. Here we used n=100.
%F A097444 n# is n primorial = product of primes 2*3*5*...*p<=n
%e A097444 5# = 2*3*5 = 30. 30+7 = 37 first prime,30+11 = 41 second prime.
%o A097444 (PARI) primorp2(n) = { pr=1; for(x=1,n, f=1; pr*=prime(x); for(m=1,n, 
               y=pr+prime(m); if(isprime(y),f=1; for(m=m+1,n, y=pr+prime(m); if(isprime(y),
               print1(y",");f=0;break,f=1)); ); if(f==0,break) ) ) }
%Y A097444 Sequence in context: A107207 A045464 A134854 this_sequence A151781 A047977 
               A139403
%Y A097444 Adjacent sequences: A097441 A097442 A097443 this_sequence A097445 A097446 
               A097447
%K A097444 nonn
%O A097444 2,1
%A A097444 Cino Hilliard (hillcino368(AT)gmail.com), Aug 23 2004

    
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 December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research