A089606 Table T(n,k), n>=1 and k>=1; the k-th row is defined by :partial sums of the sequence 1, a(1), .., a(1), a(2), .., a(2), a(3), ..,a(3), a(4), ... each term repeated k times (with a(i)= T(i,k)).
1, 2, 1, 4, 2, 1, 8, 3, 2, 1, 16, 5, 3, 2, 1, 32, 7, 4, 3, 2, 1, 64, 10, 6, 4, 3, 2, 1, 128, 13, 8, 5, 4, 3, 2, 1, 256, 18, 10, 7, 5, 4, 3, 2, 1, 512, 23, 13, 9, 6, 5, 4, 3, 2, 1, 1024, 30, 16, 11, 8, 6, 5, 4, 3, 2, 1, 2048, 37, 19, 13, 10, 7, 6, 5, 4, 3, 2, 1
Offset: 1
Links
- Alois P. Heinz, First 200 antidiagonals, flattened
Programs
-
Maple
T:= proc(n, k) option remember; `if`(n=1, 1, T(n-1, k)+T(floor((n+k-2)/k), k)) end: seq(seq(T(1+d-k,k), k=1..d), d=1..12); # Alois P. Heinz, Feb 24 2023
Comments