A106196 Triangle read by rows, generated from Pascal's triangle.
1, 1, 1, 2, 2, 1, 3, 5, 3, 1, 5, 10, 8, 4, 1, 8, 20, 17, 11, 5, 1, 13, 38, 35, 24, 14, 6, 1, 21, 71, 68, 50, 31, 17, 7, 1
Offset: 0
Examples
The operation P * A generates the array: 1, 1, 1, 1, 1, ... 1, 2, 3, 4, 5, ... 2, 5, 8, 11, 14, ... 3, 10, 17, 24, 31, ... 5, 20, 35, 50, 65, ... ... from which we extract antidiagonals, read by rows, become triangle A106196: 1; 1, 1; 2, 2, 1; 3, 5, 3, 1; 5, 10, 8, 4, 1; 8, 20, 17, 11, 5, 1; 13, 38, 35, 24, 14, 6, 1; 21, 71, 68, 50, 31, 17, 7, 1; ...
References
- V. E. Hoggatt, Jr., editor; "A Primer for the Fibonacci Numbers", 1963, p. 107.
Formula
Let P = an array with columns composed of Pascal's Triangle rows, offset, spaces filled in with zeros; A = an array composed of arithmetic sequences(n, k). Perform P * A and extract antidiagonals which become the rows of A106196.
Comments