A292049 Triangle read by rows: T(n,k) = (-1)^(k-1) * T(n-k,k-1) + T(n-k,k) with T(0,0) = 1 for 0 <= k <= A003056(n).
1, 0, 1, 0, 1, 0, 1, -1, 0, 1, -1, 0, 1, -2, 0, 1, -2, -1, 0, 1, -3, -1, 0, 1, -3, -2, 0, 1, -4, -3, 0, 1, -4, -4, 1, 0, 1, -5, -5, 1, 0, 1, -5, -7, 2, 0, 1, -6, -8, 3, 0, 1, -6, -10, 5, 0, 1, -7, -12, 6, 1, 0, 1, -7, -14, 9, 1, 0, 1, -8, -16, 11, 2, 0, 1, -8, -19
Offset: 0
Examples
First few rows are: 1; 0, 1; 0, 1; 0, 1, -1; 0, 1, -1; 0, 1, -2; 0, 1, -2, -1; 0, 1, -3, -1; 0, 1, -3, -2; 0, 1, -4, -3; 0, 1, -4, -4, 1.
Links
- Seiichi Manyama, Rows n = 0..481, flattened