A000530 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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))}.

1, 5, 28, 226, 2077, 20770, 222884, 2529541

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

COMMENTS

a(9)>=29995812 (probably equal to this value)

LINKS

Table of n, a(n) for n=1..8.

CROSSREFS

Sequence in context: A340904 A038172 A183375 * A121674 A306181 A377325

Adjacent sequences: A000527 A000528 A000529 * A000531 A000532 A000533

KEYWORD

nonn,hard,more

AUTHOR

Jonas Wallgren [ jwc(AT)ida.liu.se ]

EXTENSIONS

a(7)-a(8) from Sean A. Irvine, Nov 14 2010

STATUS

approved