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 A273515 #20 Nov 22 2018 20:23:44 %S A273515 0,0,4,0,0,5,4,4,5,0,0,4,0,0,6,5,5,7,4,4,12,4,4,7,5,5,6,0,0,4,0,0,5,4, %T A273515 4,5,0,0,4,0,0,7,6,6,9,5,5,14,5,5,10,7,7,9,4,4,12,4,4,14,12,12,14,4,4, %U A273515 12,4,4,9,7,7,10,5,5,14,5,5,9,6,6,7,0,0 %N A273515 The number of times n is rejected from the Stanley sequence S(0,1), A005836. %C A273515 This sequence gives the number of times n is a member of an arithmetic triple a<b<c (three numbers in arithmetic progression) for which the other two terms are members of A005836. A005836 is the minimal sequence that disallows any arithmetic triples. %H A273515 Max Barrentine, <a href="/A273515/b273515.txt">Table of n, a(n) for n = 0..19683</a> %F A273515 a(n) = A273513(n) + A273514(n) + A262097(n). %Y A273515 Cf. A005836, A262097, A273513, A273514, A273516. %K A273515 nonn,base %O A273515 0,3 %A A273515 _Max Barrentine_, May 23 2016