A317055 Triangle read by rows: T(0,0) = 1; T(n,k) = 10*T(n-1,k) + T(n-2,k-1) for k = 0..floor(n/2); T(n,k)=0 for n or k < 0.
1, 10, 100, 1, 1000, 20, 10000, 300, 1, 100000, 4000, 30, 1000000, 50000, 600, 1, 10000000, 600000, 10000, 40, 100000000, 7000000, 150000, 1000, 1, 1000000000, 80000000, 2100000, 20000, 50, 10000000000, 900000000, 28000000, 350000, 1500, 1, 100000000000, 10000000000, 360000000, 5600000, 35000, 60
Offset: 0
Examples
Triangle begins: 1; 10; 100, 1; 1000, 20; 10000, 300, 1; 100000, 4000, 30; 1000000, 50000, 600, 1; 10000000, 600000, 10000, 40; 100000000, 7000000, 150000, 1000, 1; 1000000000, 80000000, 2100000, 20000, 50; 10000000000, 900000000, 28000000, 350000, 1500, 1; 100000000000, 10000000000, 360000000, 5600000, 35000, 60;
References
- Shara Lalo and Zagros Lalo, Polynomial Expansion Theorems and Number Triangles, Zana Publishing, 2018, ISBN: 978-1-9995914-0-3, pp. 70, 102
Links
Crossrefs
Programs
-
Mathematica
t[0, 0] = 1; t[n_, k_] := t[n, k] = If[n < 0 || k < 0, 0, 10 t[n - 1, k] + t[n - 2, k - 1]]; Table[t[n, k], {n, 0, 11}, {k, 0, Floor[n/2]}] // Flatten
Comments