|
%I #20 Nov 22 2018 20:23:44
%S 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 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 12,4,4,9,7,7,10,5,5,14,5,5,9,6,6,7,0,0
%N The number of times n is rejected from the Stanley sequence S(0,1), A005836.
%C 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 Max Barrentine, <a href="/A273515/b273515.txt">Table of n, a(n) for n = 0..19683</a>
%F a(n) = A273513(n) + A273514(n) + A262097(n).
%Y Cf. A005836, A262097, A273513, A273514, A273516.
%K nonn,base
%O 0,3
%A _Max Barrentine_, May 23 2016
|
