Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A000530
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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))}. +0
1
1, 5, 28, 226, 2077, 20770 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Sequence in context: A151500 A107875 A038172 this_sequence A121674 A116977 A163694

Adjacent sequences: A000527 A000528 A000529 this_sequence A000531 A000532 A000533

KEYWORD

nonn,hard

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research