31674

Appears in sequences

• a(n) = Sum_{k=0..2*n} (k+1)*T(n, 2*n-k), T given by A027960.at n=10A027982
• Number of identity trees with 3-colored nodes.at n=8A038080
• Denominators of continued fraction convergents to sqrt(524).at n=12A042003
• a(n) = floor(7^7/n).at n=25A057069
• If A is a set of integers, the (2-fold) sumset consists of all the numbers which can be written as the sum of two (not necessarily distinct) elements in A. a(n) is the number of subsets of [1,2n] which are sumsets for some set of positive integers.at n=15A120411
• Antidiagonal sums of triangular array T: T(j,1) = 1 for ((j-1) mod 6) < 3, else 0; T(j,k) = T(j-1,k-1) + T(j-1,k) for 2 <= k <= j.at n=31A131025
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 0), (0, 0, -1), (0, 1, 0), (1, 0, 0)}.at n=9A149935
• Values of the difference d for 6 primes in geometric-arithmetic progression with the minimal sequence {7*7^j + j*d}, j = 0 to 5.at n=14A209205