This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A363500 #54 Jun 28 2024 22:24:20 %S A363500 6,109505970,1519435260,22606027290,25980888360,33995114580, %T A363500 42029719620,45284475810,56527358160,63402770550,73924546080, %U A363500 82625597670,121883654550,150444654360,192416460810,210205659510,258719413680,270709718160,284455564050,309050171430 %N A363500 Numbers k between twin primes p, q where k+p and k+q are also twin primes, and k*p and k*q are between twin primes. %C A363500 Larger twin primes are found on either side of 6x, so my highly-unoptimized code simply keeps adding 6 and performing the requisite primality checks using golang's "ProbablyPrime" function, a combination of Miller-Rabin and Baillie-PSW, accurate up to 2^64. Based on seminal work by fellow OEIS contributor _Antonio Gimenez_. %C A363500 To generate, k = 6x. %C A363500 p = k-1, q = k+1, check the primality of k+p, k+q, then check the primality of ((k*p) +/- 1) and ((k*q) +/- 1). %C A363500 If k > x+1 and x > 1, then all eight primes are not divisible by x. If k > 8, then k == 0 (mod 210). - _Jason Yuen_, Jun 02 2024 %H A363500 Jason Yuen, <a href="/A363500/b363500.txt">Table of n, a(n) for n = 1..10000</a> (first 49 terms from Bryce Case, Jr.) %H A363500 Bryce Case, Jr., <a href="/A363500/a363500.txt">a363500.go</a> %F A363500 a(n) = 210*A364263(n-1) for n > 1. - _Hugo Pfoertner_, Jun 03 2024 %o A363500 (Go) // See link. %Y A363500 Subsequence of A066388. %Y A363500 Cf. A364263. %K A363500 nonn %O A363500 1,1 %A A363500 _Bryce Case, Jr._ and _Antonio Gimenez_, Jun 05 2023