459808
domain: N
Appears in sequences
- Number of nX3 0..5 arrays with every element value z a city block distance of exactly z from another element value z.at n=3A208959
- T(n,k)=Number of nXk 0..5 arrays with every element value z a city block distance of exactly z from another element value z.at n=17A208960
- T(n,k)=Number of nXk 0..5 arrays with every element value z a city block distance of exactly z from another element value z.at n=18A208960
- Number of nX3 0..6 arrays with every element value z a city block distance of exactly z from another element value z.at n=3A209053
- T(n,k)=Number of nXk 0..6 arrays with every element value z a city block distance of exactly z from another element value z.at n=17A209054
- T(n,k)=Number of nXk 0..6 arrays with every element value z a city block distance of exactly z from another element value z.at n=18A209054
- T(n,k)=Number of nXk 0..7 arrays with every element value z a city block distance of exactly z from another element value z.at n=17A209218
- T(n,k)=Number of nXk 0..7 arrays with every element value z a city block distance of exactly z from another element value z.at n=18A209218
- G.f. A(x) satisfies: Sum_{n>=0} x^n * A(x)^(n*(n-1)/2) = 2 - Sum_{n>=0} (-x)^n * A(x)^(n*(n+1)/2).at n=8A337912