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 A276447 #12 Sep 12 2016 17:02:12 %S A276447 19,31,49,59,73,79,101,103,109,113,137,139,151,163,167,169,191,197, %T A276447 199,229,241,251,259,263,269,271,281,289,293,299,311,317,319,323,347, %U A276447 349,367,373,379,391,401,409,439,443,449,451,457,461,469,479,487,491,499,521,523,529,533,547,557,559,563,569,571,583,587,589,599,601 %N A276447 Numbers n for which A272565(n) < A020639(n). %H A276447 Antti Karttunen, <a href="/A276447/b276447.txt">Table of n, a(n) for n = 1..2000</a> %e A276447 19 is present as A272565(19)=5 and 5 < A020639(19)=19. (19 is right after 5 on the third row of array A255127 while on A083221 it occurs at the beginning of row 8 that starts with 19 itself). %e A276447 49 is present as it occurs as the fourth number on the third row of A255127 beginning with 5: 5, 19, 35, 49, ..., thus A272565(49)=5, while in A083221 49 occurs right after 7 on row 4, thus A020639(49)=7, and 5 < 7. %o A276447 (Scheme, with _Antti Karttunen_'s IntSeq-library) %o A276447 (define A276447 (MATCHING-POS 1 1 (lambda (n) (< (A272565 n) (A020639 n))))) %Y A276447 Cf. A276448 (complement in A276437), A276347. %Y A276447 Cf. A020639, A272565, A192505, A083221, A255127. %K A276447 nonn %O A276447 1,1 %A A276447 _Antti Karttunen_, Sep 11 2016