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 A153308 #11 Sep 08 2022 08:45:39 %S A153308 2,5,7,8,11,14,17,18,20,21,23,24,26,28,29,32,35,37,38,40,41,42,43,44, %T A153308 47,49,50,51,52,53,56,59,62,63,65,66,68,69,70,71,73,74,76,77,80,81,83, %U A153308 84,86,89,91,92,95,98,100,101,102,103,104,105,106,107 %N A153308 Numbers n such that 10*n+7 is not prime. %H A153308 Vincenzo Librandi, <a href="/A153308/b153308.txt">Table of n, a(n) for n = 1..1000</a> %e A153308 Distribution of the terms in the following triangular array: %e A153308 *; %e A153308 *,*; %e A153308 *,*,*; %e A153308 2,*,*,*; %e A153308 *,*,7,*,*; %e A153308 *,*,*,11,*,*; %e A153308 *,*,*,*,*,*,*; %e A153308 *,*,*,*,18,*,*,*; %e A153308 5,*,*,*,*,24,*,*,*; %e A153308 *,*,14,*,*,*,*,35,*,*; %e A153308 *,*,*,20,*,*,*,*,43,*,*;etc. %e A153308 where * marks the non-integer values of (2*h*k + k + h - 3)/5 with h >= k >= 1. - _Vincenzo Librandi_, Jan 17 2013 %t A153308 Select[Range[0, 200], !PrimeQ[10*# + 7]&] (* _Vincenzo Librandi_, Jan 12 2013 *) %o A153308 (Magma) [n: n in [0..150] | not IsPrime(10*n + 7)]; // _Vincenzo Librandi_, Jan 12 2013 %Y A153308 A102342. %K A153308 nonn,easy %O A153308 1,1 %A A153308 _Vincenzo Librandi_, Dec 23 2008