34970

Appears in sequences

• Number of paths from (0,0) to (3n,0) that stay in first quadrant (but may touch horizontal axis) and where each step is (2,1), (1,2) or (1,-1).at n=6A027307
• Triangle read by rows of numbers of paths in a lattice satisfying certain conditions.at n=27A071949
• Length of list created by n substitutions k -> Range[-abs(k+1), abs(k-1), 2] starting with {0}.at n=11A084078
• Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1), U=(1,2), or d=(1,-1) and having height of the first peak equal to k.at n=42A108437
• Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and having height of last peak equal to k.at n=42A109158
• A convolution triangle of numbers based on A027307.at n=21A110682
• Number of paths from (0,0) if n is even, or from (2,1) if n is odd, to (3n,0) that stay in first quadrant (but may touch horizontal axis) and where each step is (2,1), (1,2) or (1,-1).at n=12A137842
• Numbers k that divide the sum of digits of 13^k.at n=50A175525
• Numbers that can be represented as a sum of two distinct nontrivial prime powers in three or more ways.at n=35A225104
• Numbers which are the sum of two squared primes in exactly three ways (ignoring order).at n=13A226562
• Even numbers that cannot be expressed as a sum of 3 or fewer terms of A035928.at n=25A278546
• Numbers of the form m^2 + 1 that can be expressed in more than one way as j^2 + k^2 with j > k > 1 and gcd(j,k) = 1.at n=21A300166
• Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = Sum_{j=0..n} binomial(n,j) * binomial(k*n+j+1,n)/(k*n+j+1).at n=42A336534