Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A119825
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A119825 Triangle read by rows: T(n,k) is the number of ternary sequences of length n containing k subsequences 000 (consecutively; n,k>=0). +0
3
1, 3, 9, 26, 1, 76, 4, 1, 222, 16, 4, 1, 648, 60, 16, 4, 1, 1892, 212, 62, 16, 4, 1, 5524, 728, 224, 64, 16, 4, 1, 16128, 2444, 788, 236, 66, 16, 4, 1, 47088, 8064, 2712, 848, 248, 68, 16, 4, 1, 137480, 26256, 9168, 2984, 908, 260, 70, 16, 4, 1, 401392, 84576, 30576 (list; graph; listen)
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