|
%I #18 Jun 28 2022 10:58:04
%S 1,1,2,1,1,2,2,3,3,1,1,2,1,1,2,2,3,3,2,3,3,4,4,5,4,4,5,1,1,2,1,1,2,2,
%T 3,3,1,1,2,1,1,2,2,3,3,2,3,3,4,4,5,4,4,5,2,3,3,4,4,5,4,4,5,5,6,6,5,6,
%U 6,7,7,8,5,6,6,5,6,6,7,7,8,1,1,2,1,1,2,2,3,3,1,1,2,1,1,2,2,3,3,2,3,3,4,4,5
%N a(1)=1 and, for n>1, a(n) is the smallest positive integer such that the subset S(c) of {1,2,3,...,n} defined by S(c)={k|1<=k<=n; a(k)=c} does not contain a 3-term arithmetic progression for any integer c.
%C The sequence of values of n for which a(n)=1 is given by {A005836(i)-1}.
%H Samuel B. Reid, <a href="/A100480/b100480.txt">Table of n, a(n) for n = 1..10000</a>
%H Samuel B. Reid, <a href="/A100480/a100480.py.txt">Python program for A100480</a>
%F a(n + 1) = A006997(n) + 1 for any n >= 0. - _Rémy Sigrist_, Jun 28 2022
%o (Python) # See Links section.
%Y Cf. A005836, A006997, A135415, A229037.
%K nonn
%O 1,3
%A _John W. Layman_, Nov 22 2004
|
