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 A216290 #19 Jun 21 2022 10:27:40 %S A216290 1,40426,85405,191434,209896,369853,598774,652468,719986,797116, %T A216290 1028749,1097752,1874920,1892458,1898398,2041768,2389861,2390344, %U A216290 2462944,2651881,3182338,3230953,3314239,3531106,3717985,3734347,3898165,3940438,3994096,4075846,4523548,4870279,5176018 %N A216290 Values of k such that 100k+1, 100k+3, 100k+7, 100k+9, 100k+13, 100k+27 are consecutive primes. %H A216290 David A. Corneth, <a href="/A216290/b216290.txt">Table of n, a(n) for n = 1..12224</a> (Using Luhn table from A022006) %e A216290 1 is in the sequence as 100*1 + 1 = 101, 100*1 + 3 = 103, 100*1 + 7 = 107, 100*1 + 9 = 109, 100*1 + 13= 113, 100*1 + 27 = 127 are consecutive primes of the form 100k+1, 100k+3, 100k+7, 100k+9, 100k+13, 100k+27 respectively where k = 1. - _David A. Corneth_, Jun 21 2022 %o A216290 (PARI) is(n) = {my(v = [100*n+1,100*n+3,100*n+7,100*n+9,100*n+13,100*n+27], t = 0); forprime(p = 100*n+1, oo, t++; if(v[t] != p, return(0)); if(t >= 6, return(1)))} \\ _David A. Corneth_, Jun 21 2022 %o A216290 (Python) %o A216290 from sympy import nextprime %o A216290 def ok(n): %o A216290 t, targets = 100*n, [100*n+d for d in [1, 3, 7, 9, 13, 27]] %o A216290 return all((t:=nextprime(t)) == targets[i] for i in range(6)) %o A216290 print([k for k in range(10**6) if ok(k)]) # _Michael S. Branicky_, Jun 21 2022 %Y A216290 Cf. A022006, A031932. %K A216290 nonn %O A216290 1,2 %A A216290 _V. Raman_, Sep 03 2012