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 A114914 #11 Aug 24 2024 06:01:20
%S A114914 76,101,149,198,201,251,326,351,368,394,426,451,476,489,492,514,601,
%T A114914 626,639,683,688,701,801,835,879,884,933,973,976,1051,1076,1098,1168,
%U A114914 1176,1178,1201,1215,1227,1251,1301,1351,1359,1374,1376,1459,1551,1570
%N A114914 Terms in A114913 that are not in A111174.
%C A114914 If 24*k+1 = 25*p for some prime p, then k will be in this sequence, implying that this sequence is infinite. - _Dean Hickerson_, Jan 19 2006
%H A114914 Amiram Eldar, <a href="/A114914/b114914.txt">Table of n, a(n) for n = 1..10000</a>
%t A114914 q[n_] := Module[{f = FactorInteger[n], f1, f2}, f1 = Select[f, MemberQ[{1, 5, 7, 11}, Mod[First[#], 24]] &]; f2 = Select[f, MemberQ[{13, 17, 19, 23}, Mod[First[#], 24]] &]; AllTrue[f2[[;;, 2]], EvenQ] && Count[f1[[;;, 2]], _?OddQ] == 1]; Select[Range[1600], CompositeQ[24 * # + 1] && q[24 * # + 1] &] (* _Amiram Eldar_, Aug 24 2024 *)
%Y A114914 Cf. A111174, A114913.
%K A114914 nonn
%O A114914 1,1
%A A114914 _Christian G. Bower_, Jan 06 2006