[go: up one dir, main page]

login
Search: a114495 -id:a114495
     Sort: relevance | references | number | modified | created      Format: long | short | data
Triangle read by rows: Catalan triangle of the k-Fibonacci sequence.
+10
2
1, 1, 1, 1, 2, 3, 1, 3, 7, 8, 1, 4, 12, 22, 24, 1, 5, 18, 43, 73, 75, 1, 6, 25, 72, 156, 246, 243, 1, 7, 33, 110, 283, 564, 844, 808, 1, 8, 42, 158, 465, 1092, 2046, 2936, 2742, 1, 9, 52, 217, 714, 1906, 4178, 7449, 10334, 9458, 1, 10, 63, 288, 1043, 3096, 7670, 15904, 27231, 36736, 33062
Triangle read by rows: T(n,k) is number of hill-free Dyck paths of semilength n and having k returns to the x-axis. (A Dyck path is said to be hill-free if it has no peaks at level 1.)
+10
1
0, 1, 2, 5, 1, 14, 4, 42, 14, 1, 132, 48, 6, 429, 165, 27, 1, 1430, 572, 110, 8, 4862, 2002, 429, 44, 1, 16796, 7072, 1638, 208, 10, 58786, 25194, 6188, 910, 65, 1, 208012, 90440, 23256, 3808, 350, 12, 742900, 326876, 87210, 15504, 1700, 90, 1, 2674440, 1188640
Triangle read by rows: T(n,k) is the number of hill-free Dyck paths of semilength n and having k peaks at level 2; 0<= k<=n-1, n>=2 (a Dyck path is said to be hill-free if it has no peaks at level 1).
+10
1
0, 1, 1, 0, 1, 2, 2, 1, 1, 6, 6, 3, 2, 1, 19, 17, 12, 5, 3, 1, 61, 56, 36, 20, 8, 4, 1, 202, 185, 120, 66, 31, 12, 5, 1, 683, 624, 409, 224, 110, 46, 17, 6, 1, 2348, 2144, 1408, 784, 385, 172, 66, 23, 7, 1, 8184, 7468, 4920, 2760, 1380, 624, 257, 92, 30, 8, 1, 28855, 26317
Convolution triangle of A000958(n+1).
+10
1
1, 1, 1, 3, 2, 1, 8, 7, 3, 1, 24, 22, 12, 4, 1, 75, 73, 43, 18, 5, 1, 243, 246, 156, 72, 25, 6, 1, 808, 844, 564, 283, 110, 33, 7, 1, 2742, 2936, 2046, 1092, 465, 158, 42, 8, 1, 9458, 10334, 7449, 4178, 1906, 714, 217, 52, 9, 1, 33062, 36736, 27231, 15904, 7670, 3096, 1043, 288, 63, 10, 1

Search completed in 0.007 seconds