A258643 Irregular triangle read by rows, n >= 1, k >= 0: T(n,k) is the number of distinct patterns of n X n squares with k holes that are squares (see the construction rule in comments).
1, 1, 2, 1, 3, 1, 2, 9, 7, 4, 4, 5, 2, 25, 11, 40, 8, 33, 3, 16, 0, 4
Offset: 1
Examples
Irregular triangle begins: n\k 0 1 2 3 4 5 6 7 8 ... 1 1 2 1 3 2 1 4 3 1 2 5 9 7 4 4 5 2 6 25 11 40 8 33 3 16 0 4 ...
Links
- Kival Ngaokrajang, Illustration of pattern T(n,k) for n = 1..5, k >= 0, T(6,k) patterns
- Wikipedia, Vicsek fractal
Comments