Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A119851
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A119851 Triangle read by rows: T(n,k) is the number of ternary words of length n containing k 012's (n>=0, 0<=k<=floor(n/3)). +0
2
1, 3, 9, 26, 1, 75, 6, 216, 27, 622, 106, 1, 1791, 387, 9, 5157, 1350, 54, 14849, 4566, 267, 1, 42756, 15102, 1179, 12, 123111, 49113, 4833, 90, 354484, 157622, 18798, 536, 1, 1020696, 500520, 70317, 2775, 15, 2938977, 1575558, 255231, 13068, 135 (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 20 16:54 EST 2009. Contains 171081 sequences.


AT&T Labs Research