Triangle T(n, k) = 2^(n+k-2)*prime(k) + (n mod 2) if k <= floor(n/2) otherwise 2^(2*n-k-2)*prime(n-k) + (n mod 2), with T(n, 0) = T(n, n) = 1, read by rows.
A157192
Triangle T(n, k) = 2^(n+k-2)*prime(k) + (n mod 2) if k <= floor(n/2) otherwise 2^(2*n-k-2)*prime(n-k) + (n mod 2), with T(n, 0) = T(n, n) = 1, read by rows.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =4a(5) =1a(6) =1a(7) =9a(8) =9a(9) =1a(10) =1a(11) =16a(12) =48a(13) =16a(14) =1a(15) =1a(16) =33a(17) =97a(18) =97a(19) =33a(20) =1a(21) =1a(22) =64a(23) =192a(24) =640a(25) =192a(26) =64a(27) =1a(28) =1a(29) =129
External references
- oeis: A157192