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 A265437 #8 Dec 13 2015 22:39:05 %S A265437 1,4,38,46,65,94,107,116,128,131,140,143,149,152,170,188,227,230,248, %T A265437 272,293,302,317,335,344,359,371,382,404,488,530,533,551,584,626,647, %U A265437 722,767,803,815,866,875,893,914,920,1016,1034,1040,1070,1082,1133,1160 %N A265437 Numbers n such that A265433(n) = 0 and n is not a multiple of 3. %C A265437 Conjecture: if n > 4 is in the sequence, then A137269(n) > 0 due to primes with only digits 2, 3, 4. %H A265437 Chai Wah Wu, <a href="/A265437/b265437.txt">Table of n, a(n) for n = 1..100</a> %Y A265437 Cf. A137269, A265433. %K A265437 nonn,base %O A265437 1,2 %A A265437 _Chai Wah Wu_, Dec 10 2015