Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A118890
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A118890 Triangle read by rows: T(n,k) is the number of binary sequences of length n containing k subsequences 0110 (n,k>=0). +0
3
1, 2, 4, 8, 15, 1, 28, 4, 52, 12, 97, 30, 1, 181, 70, 5, 338, 156, 18, 631, 339, 53, 1, 1178, 722, 142, 6, 2199, 1515, 357, 25, 4105, 3140, 862, 84, 1, 7663, 6444, 2018, 252, 7, 14305, 13116, 4614, 700, 33, 26704, 26513, 10348, 1846, 124, 1, 49850, 53280, 22844 (list; graph; listen)
page 1

Search completed in 0.001 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 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research