7173370
domain: N
Appears in sequences
- To compute a(n) we first write down 5^n 1's in a row. Each row takes the rightmost 5th 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 5th part. The single element in the last row is a(n).at n=5A109057
- Number of n-tuples (p_1, p_2, ..., p_n) of positive integers such that p_{i-1} <= p_i <= n^(i-1).at n=5A355561
- Number A(n,k) of n-tuples (p_1, p_2, ..., p_n) of positive integers such that p_{i-1} <= p_i <= k^(i-1); square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=60A355576