216318
domain: N
Appears in sequences
- Number of (s(0), s(1), ..., s(2n+1)) such that 0 < s(i) < 9 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n+1, s(0) = 3, s(2n+1) = 4.at n=10A094832
- Expansion of x*(1+x) / (1-3*x^2-x^3).at n=21A188022
- Number of ways to reciprocally link elements of an n X n X n triangular array with themselves or a neighbor, with no more than 2 elements linked to themselves.at n=6A271611
- Number of ways to reciprocally link elements of an n X n X n triangular array with themselves or a neighbor, with no more than 3 elements linked to themselves.at n=6A271612
- T(n,k) = Number of ways to reciprocally link elements of an n X n X n triangular array with themselves or a neighbor, with no more than k elements linked to themselves.at n=34A271617
- T(n,k) = Number of ways to reciprocally link elements of an n X n X n triangular array with themselves or a neighbor, with no more than k elements linked to themselves.at n=42A271617