39656

Appears in sequences

• To compute a(n) we first write down 6^n 1's in a row. Each row takes the rightmost 6th 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 6th part. The single element in the last row is a(n).at n=4A109058
• a(n) is the numerator of Sum_{d|n} sigma(n/d)^d/d, where sigma is A000203.at n=24A267310
• Even numbers that are not the sum or difference of two binary palindromes (A006995).at n=10A290424
• Number of quadruples (p_1, ..., p_4) of positive integers such that p_{i-1} <= p_i <= n^(i-1).at n=6A354608
• 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=59A355576
• E.g.f. A(x) satisfies A(x) = 1 + Sum_{k>=1} x^k/k! * A(k^k*x).at n=5A385549