Triangular array T read by rows (9-diamondization of Pascal's triangle). Step 1: t(n,k) = sum of 9 entries in diamond-shaped subarray of Pascal's triangle having vertices C(n,k), C(n+4,k+2), C(n+2,k), C(n+2,k+2). Step 2: T(n,k) = t(n,k) - t(0,0) + 1.
A026907
Triangular array T read by rows (9-diamondization of Pascal's triangle). Step 1: t(n,k) = sum of 9 entries in diamond-shaped subarray of Pascal's triangle having vertices C(n,k), C(n+4,k+2), C(n+2,k), C(n+2,k+2). Step 2: T(n,k) = t(n,k) - t(0,0) + 1.
Terms
- a(0) =1a(1) =13a(2) =13a(3) =28a(4) =44a(5) =28a(6) =46a(7) =90a(8) =90a(9) =46a(10) =67a(11) =154a(12) =198a(13) =154a(14) =67a(15) =91a(16) =239a(17) =370a(18) =370a(19) =239a(20) =91a(21) =118a(22) =348a(23) =627a(24) =758a(25) =627a(26) =348a(27) =118a(28) =148a(29) =484
External references
- oeis: A026907