34188

Appears in sequences

• a(n) is the number of paths from (0,0) to (n,0) using steps of the form (1,2),(1,1),(1,0),(1,-1) or (1,-2) and staying above the x-axis. Also, a(n) is the number of possible combinations of balls on the lawn after n turns, using a Motzkin variation of the (4,2)-case of the tennis ball problem considered by D. Merlini, R. Sprugnoli and M. C. Verri.at n=9A104184
• Numbers k whose digits can be divided into two contiguous parts, k = concatenate(x, y), such that k = |x^2 - y^2|.at n=8A113797
• a(n) = 25*n^2 - n.at n=36A157514
• a(n) = 1369*n^2 - 37.at n=4A158743
• Numbers k which are concatenations k = x//y such that y^2 - x^2 = k.at n=4A162700
• Denominators a(n) of Pythagorean approximations b(n)/a(n) to 1/3.at n=8A195556
• T(n,k) = Number of length n+1 nonnegative integer arrays starting and ending with 0 with adjacent elements differing by no more than k.at n=53A204213
• Integers n such that n^2 = 2*x*(y-x), where x and y are consecutive terms in A014574.at n=21A255230
• Sequences n*(n+1)*(6*n+1)/2 and n*(n+1)*(7*n+1)/2 interleaved.at n=42A296636
• a(n) = 4^n*binomial(n - 1/2, -1/2)*(n^2 + 1).at n=6A344399