|
Search: id:A063894
|
|
|
| A063894 |
|
Start with x, y; then concatenate each word in turn with all preceding words, getting x y xy xxy yxy xxxy yxxy xyxxy ...; sequence gives number of words of length n. Also binary trees by degree: x y (x,y) (x,(x,y)) (y,(x,y)) (x,(x,(x,y))) (y,(x,(x,y))) ((x,y),(x,(x,y)))... |
|
+0
3
|
|
| 2, 1, 2, 4, 10, 25, 68, 187, 532, 1532, 4492, 13308, 39870, 120433, 366656, 1123504, 3463050, 10729234, 33396202, 104381385, 327477814, 1030903514, 3255394686, 10309154738, 32732315724, 104177891232, 332308237666, 1062192108053
(list; graph; listen)
|
|
|
Search completed in 0.001 seconds
|
