Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A129709
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A129709 Triangle read by rows: T(n,k) is the number of Fibonacci binary words of length n and having k 011 subwords (0<=k<=floor(n/3)). A Fibonacci binary word is a binary word having no 00 subword. +0
1
1, 2, 3, 4, 1, 5, 3, 6, 7, 7, 13, 1, 8, 22, 4, 9, 34, 12, 10, 50, 28, 1, 11, 70, 58, 5, 12, 95, 108, 18, 13, 125, 188, 50, 1, 14, 161, 308, 121, 6, 15, 203, 483, 261, 25, 16, 252, 728, 520, 80, 1, 17, 308, 1064, 968, 220, 7, 18, 372, 1512, 1710, 536, 33, 19, 444, 2100 (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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research