# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a276207
Showing 1-1 of 1

%I A276207 #10 Jun 08 2017 16:33:47
%S A276207 0,0,1,0,0,2,4,1,1,0,0,5,0,0,3,7,2,3,2,4,1,1,12,1,5,1,1,0,0,13,0,0,10,
%T A276207 9,6,7,0,0,18,0,0,15,4,14,7,6,8,2,6,3,16,3,3,2,3,7,1,10,25,8,5,1,1,1,
%U A276207 4,14,27,4,1,1,10,2,2,6,1,26,8,1,19,1,1,0,0,13,0,0,7,24,2,19,0,0,34,0,0,29,32,32,5,15,21,14,15,6,6,24,13,39,0,0,24,0
%N A276207 a(0) = a(1) = 0. For n>1 a(n) is the smallest nonnegative integer such that there is no arithmetic progression m_1,m_2,...,m_i,n (2<=i<n) such that a(m_1)+a(m_2)+...+a(m_i) = a(n).
%C A276207 The distribution of zeros is the same as in A276204.
%H A276207 Michal Urbanski, <a href="/A276207/b276207.txt">Table of n, a(n) for n = 0..49999</a>
%e A276207 For n = 5 we have that:
%e A276207 a(5)>0, because a(3)+a(4)=0 and 3,4,5 is an arithmetic progression
%e A276207 a(5)>1, because a(2)+a(3)+a(4)=1 and 2,3,4,5 is an arithmetic progression
%e A276207 there is no such arithmetic progression m_1,m_2,...,m_i,5 that a(m_1)+a(m_2)+...+a(m_i)=2, so a(5) = 2.
%Y A276207 Cf. A276204 (length 3), A276205 (length 4), A276206 (length 5).
%K A276207 nonn
%O A276207 0,6
%A A276207 _Michal Urbanski_, Aug 24 2016

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE