A000530 - cp's OEIS frontend

A000530 Let p(n, s, x) be predicate that number of occurrences of s's in x >= 2n - the length of the longest sequence of s's in x. Then a(n)=#{x in {0,1} | x ends in 0 and p(n,0,x) and (there is no prefix y of x such that p(n,0,y) or p(n,1,y))}.

%I A000530 #10 May 09 2013 11:06:03
%S A000530 1,5,28,226,2077,20770,222884,2529541
%N A000530 Let p(n, s, x) be predicate that number of occurrences of s's in x >= 2*n - the length of the longest sequence of s's in x. Then a(n)=#{x in {0,1}* | x ends in 0 and p(n,0,x) and (there is no prefix y of x such that p(n,0,y) or p(n,1,y))}.
%C A000530 a(9)>=29995812 (probably equal to this value)
%K A000530 nonn,hard,more
%O A000530 1,2
%A A000530 Jonas Wallgren [ jwc(AT)ida.liu.se ]
%E A000530 a(7)-a(8) from _Sean A. Irvine_, Nov 14 2010

cp's OEIS Frontend

A000530 Let p(n, s, x) be predicate that number of occurrences of s's in x >= 2*n - the length of the longest sequence of s's in x. Then a(n)=#{x in {0,1}* | x ends in 0 and p(n,0,x) and (there is no prefix y of x such that p(n,0,y) or p(n,1,y))}.

A000530 Let p(n, s, x) be predicate that number of occurrences of s's in x >= 2n - the length of the longest sequence of s's in x. Then a(n)=#{x in {0,1} | x ends in 0 and p(n,0,x) and (there is no prefix y of x such that p(n,0,y) or p(n,1,y))}.