231736
domain: N
Appears in sequences
- To compute a(n) we first write down 8^n 1's in a row. Each row takes the rightmost 8th part of the previous row and each element in it equals sum of the elements of the previous row starting with the first of the rightmost 8th part. The single element in the last row is a(n).at n=4A109060
- Number of (n+1) X 6 0..3 arrays with every 2 X 2 subblock summing to 6.at n=5A183638
- Number of (n+1) X 7 0..3 arrays with every 2 X 2 subblock summing to 6.at n=4A183639
- Number of quadruples (p_1, ..., p_4) of positive integers such that p_{i-1} <= p_i <= n^(i-1).at n=8A354608