Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093739
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093739 Number of prime pairs below 10^n having a difference of 8. +0
3
0, 1, 15, 101, 773, 5569, 42352, 334180, 2695109 (list; graph; listen)
OFFSET

1,3

FORMULA

Count prime pairs below 10^n having a difference of 8

EXAMPLE

a(3)=15 because there are 15 prime gaps of 8 below 10^3

PROGRAM

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 A093739 A093740.

Sequence in context: A087661 A163717 A111370 this_sequence A085465 A102791 A061550

Adjacent sequences: A093736 A093737 A093738 this_sequence A093740 A093741 A093742

KEYWORD

easy,nonn

AUTHOR

Enoch Haga (Enokh(AT)comcast.net), Apr 15 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