A245093 Triangle read by rows in which row n lists the first n terms of A000203.
1, 1, 3, 1, 3, 4, 1, 3, 4, 7, 1, 3, 4, 7, 6, 1, 3, 4, 7, 6, 12, 1, 3, 4, 7, 6, 12, 8, 1, 3, 4, 7, 6, 12, 8, 15, 1, 3, 4, 7, 6, 12, 8, 15, 13, 1, 3, 4, 7, 6, 12, 8, 15, 13, 18, 1, 3, 4, 7, 6, 12, 8, 15, 13, 18, 12, 1, 3, 4, 7, 6, 12, 8, 15, 13, 18, 12, 28
Offset: 1
Examples
Triangle begins: 1; 1, 3; 1, 3, 4; 1, 3, 4, 7; 1, 3, 4, 7, 6; 1, 3, 4, 7, 6, 12; 1, 3, 4, 7, 6, 12, 8; 1, 3, 4, 7, 6, 12, 8, 15; 1, 3, 4, 7, 6, 12, 8, 15, 13; 1, 3, 4, 7, 6, 12, 8, 15, 13, 18; 1, 3, 4, 7, 6, 12, 8, 15, 13, 18, 12; 1, 3, 4, 7, 6, 12, 8, 15, 13, 18, 12, 28;
Links
- Reinhard Zumkeller, Rows n = 1..125 of triangle, flattened
Crossrefs
Programs
-
Haskell
import Data.List (inits) a245093 n k = a245093_tabl !! (n-1) !! (k-1) a245093_row n = a245093_tabl !! (n-1) a245093_tabl = tail $ inits $ a000203_list -- Reinhard Zumkeller, Dec 12 2015
Formula
T(n,k) = A000203(k), 1<=k<=n.
Comments