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 A153763 #14 Sep 08 2022 08:45:40 %S A153763 0,2,3,5,6,7,9,12,14,15,17,18,19,20,21,22,24,25,26,27,30,32,33,35,36, %T A153763 37,39,40,42,44,45,46,47,48,51,52,54,57,58,59,60,61,62,63,65,66,67,68, %U A153763 69,72,75,77,78,80,81,82,84,85,86,87,88,89,90,91,92,93 %N A153763 Numbers k >= 0 such that 8*k+9 is not prime. %H A153763 Vincenzo Librandi, <a href="/A153763/b153763.txt">Table of n, a(n) for n = 1..1000</a> %e A153763 Distribution of the terms in the following triangular array: %e A153763 0; %e A153763 *,2; %e A153763 *,*,5; %e A153763 *,*,*,9; %e A153763 3,*,*,*,14; %e A153763 *,7,*,*,*,20; %e A153763 *,*,12,*,*,*,27; %e A153763 *,*,*,18,*,*,*,35; %e A153763 6,*,*,*,25,*,*,*,44; %e A153763 *,12,*,*,*,33,*,*,*,54; %e A153763 *,*,19,*,*,*,42,*,*,*,65; etc. %e A153763 where * marks the non-integer values of (2*h*k + k + h - 4)/4 with h >= k >= 1. - _Vincenzo Librandi_, Jan 14 2013 %t A153763 Select[Range[0, 200], !PrimeQ[8 # + 9] &] (* _Vincenzo Librandi_, Jan 14 2013 *) %o A153763 (Magma) [n: n in [0..150] | not IsPrime(8*n+9)]; // _Vincenzo Librandi_, Jan 14 2013 %Y A153763 Cf. A153762, A023232. %K A153763 nonn,easy %O A153763 1,2 %A A153763 _Vincenzo Librandi_, Jan 01 2009