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 A335303 #14 Jun 01 2020 09:49:08
%S A335303 1,2,3,4,5,6,8,12,18,30,60,70,78,150,220,240,340,360,396,672,840,1188,
%T A335303 1365,1665,3080,3770,6420,7317,9952,10356,12972,18318,19218,20544,
%U A335303 21996,24750,28656,34543,37449,41910,180622,201570,245115,728028,856420,897022,986794
%N A335303 Numbers k such that k divides sum of k-th twin prime pair.
%H A335303 Chris K. Caldwell and G. L. Honaker, Jr., <a href="https://primes.utm.edu/curios/page.php?curio_id=38144">Prime Curio for 34543</a>
%e A335303 8 is a term because sum of 8th twin prime pair is 71 + 73 = 8*18.
%t A335303 l={};c=0;Do[If[PrimeQ[Prime[n]+2],c=c+1;If[IntegerQ[(2*Prime[n]+2)/c], AppendTo[l,c]]] ,{n,2,10000}];l
%o A335303 (PARI) is(n) = {!bittest(n, 0)&&isprime(n\2-1)&&isprime(n\2+1)}; \\ A054735
%o A335303 lista(nn) = {my(nb=0); for (n=1, nn, if (is(n), nb++; if ((n % nb) == 0, print1(nb, ", "));););} \\ _Michel Marcus_, Jun 01 2020
%Y A335303 Cf. A001097, A001359, A006512, A054735, A077800, A335304.
%K A335303 nonn
%O A335303 1,2
%A A335303 _Metin Sariyar_, May 31 2020