Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A131283
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A131283 a(n) is the number of binary strings of length n such that there exist 3 or more ones in a subsequence of length 5 or less. +0
11
0, 0, 1, 5, 16, 38, 85, 185, 396, 838, 1748, 3609, 7400, 15097, 30681, 62154, 125588, 253246, 509850, 1025153, 2059159, 4132679, 8288643, 16615051, 33291367, 66682128, 133525499, 267312553, 535049374, 1070786975, 2142690382 (list; graph; listen)
OFFSET

1,4
FORMULA

a(n) = 2^n - A120118.

CROSSREFS

Cf. A118647, A118646.

Sequence in context: A041044 A042645 A011932 this_sequence A082199 A082190 A155965

Adjacent sequences: A131280 A131281 A131282 this_sequence A131284 A131285 A131286

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 21 10:15 EST 2009. Contains 171081 sequences.

AT&T Labs Research

Legal Notice
© 2009 AT&T Intellectual Property. All Rights Reserved.