Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130902
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130902 a(n) is the number of binary strings of length n such that there exist 4 or more ones in a subsequence of length 5 or less. +0
1
0, 0, 0, 1, 6, 16, 39, 91, 207, 463, 1014, 2188, 4671, 9888, 20786, 43435, 90302, 186934, 385547, 792642, 1625035, 3323393, 6782041, 13813588, 28087444, 57023945, 115614136, 234117510, 473564782, 956961354, 1932059363, 3897575310 (list; graph; listen)
OFFSET

0,5

FORMULA

a(n) = 2^n - A125513(n).

CROSSREFS

Cf. A118647, A118646.

Sequence in context: A058272 A049712 A092274 this_sequence A009955 A123205 A123607

Adjacent sequences: A130899 A130900 A130901 this_sequence A130903 A130904 A130905

KEYWORD

nonn

AUTHOR

Tanya Khovanova (tanyakh(AT)yahoo.com), Sep 28 2007

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 2 15:58 EST 2008. Contains 150992 sequences.


AT&T Labs Research