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 A100419 #31 Nov 05 2024 12:03:39
%S A100419 89,6627,18674,223949,229269,240007,267356,606681,638454,771496,
%T A100419 951060,1068030,1150693,1254839,1688923,1920084,2413577,2433289,
%U A100419 2649414,3053398,3080572,3337444,3586658,3604256,3830335,4137166
%N A100419 Numbers k such that 30*k+{1,7,13,17,19,23,29} are all prime.
%C A100419 Values are 5 mod 7.
%C A100419 In each case, the 7 primes are necessarily consecutive. See the comment in A100418. - _Peter Munn_, Sep 06 2023
%H A100419 Michael S. Branicky, <a href="/A100419/b100419.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..2020 from Robert Israel)
%p A100419 filter:= proc(n) local j; andmap(isprime, [seq(30*n+j,j=[1,7,13,17,19,23,29])]) end proc:
%p A100419 select(filter, [seq(i,i=5..5*10^6,7)]); # _Robert Israel_, Nov 04 2024
%t A100419 Select[Range[42*10^5],AllTrue[30#+{1,7,13,17,19,23,29},PrimeQ]&] (* The program uses the AllTrue function from Mathematica version 10 *) (* _Harvey P. Dale_, Mar 10 2018 *)
%o A100419 (Magma) [ n: n in [5..70000000 by 7] | forall{ q: q in [1, 7, 13, 17, 19, 23, 29] | IsPrime(30*n+q) } ]; // _Klaus Brockhaus_, Feb 24 2011
%Y A100419 Cf. A005776, A007775, A076205, A100418, A100420-A100423.
%K A100419 nonn
%O A100419 1,1
%A A100419 Ferenc Adorjan (fadorjan(AT)freemail.hu), Nov 19 2004
%E A100419 Edited by _Don Reble_, Nov 17 2005