|
| |
|
|
A093743
|
|
Number of prime pairs below 10^n having a difference of 16.
|
|
2
| | |
|
|
|
OFFSET
| 1,4
|
|
|
FORMULA
| Count prime pairs below 10^n having a difference of 16
|
|
|
EXAMPLE
| a(4)=33 because there are 33 prime gaps of 16 below 10^3
|
|
|
PROG
| UBASIC: 20 N=1:dim T(34); 30 A=nxtprm(N); 40 N=A; 50 B=nxtprm(N); 60 D=B-A; 70 for x=2 to 34 step 2; 80 if D=X and B<10^2+1 then T(X)=T(X)+1; 90 next X; 100 if B>10^2+1 then 140; 110 B=A; 120 N=N+1; 130 goto 30; 140 for x=2 to 34 step 2; 150 print T(X); , 160 next (This program simultaneously finds values from 2 to 34 - if gap=2 add 1- adjust lines 80 and 100 for desired 10^n)
|
|
|
CROSSREFS
| Cf. A007508 A093742 A093744.
Sequence in context: A024400 A081932 A121994 * A167963 A085742 A202256
Adjacent sequences: A093740 A093741 A093742 * A093744 A093745 A093746
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Enoch Haga (Enokh(AT)comcast.net), Apr 15 2004
|
| |
|
|
