52736

Appears in sequences

• a(n) = T(n,2), array T as in A049600.at n=12A049611
• Binomial transform, alternating in sign, of the tribonacci numbers.at n=27A073358
• Binomial transform, alternating in sign, of the tribonacci numbers.at n=28A073358
• Binomial transform of binomial(n+2,2).at n=11A084851
• a(1) = 1, otherwise a(n) = floor(e^(n+1)/(e^2 + 1)).at n=12A090039
• Expansion of (1+x)/(1+2x-2x^3).at n=27A124342
• a(n) = 2a(n-2) + 4a(n-3), n >= 3.at n=20A134812
• 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, 0), (-1, 1, -1), (0, 1, -1), (0, 1, 1), (1, 0, 0)}.at n=9A150007
• The EG1 triangle.at n=11A162005
• Second left hand column of the EG1 triangle A162005.at n=3A162006
• Fourth right hand column of the EG1 triangle A162005.at n=1A162009
• Numbers of the form p^9*q where p and q are distinct primes.at n=26A179692
• Number of rooted binary trees with n leaves and each internal vertex colored in one of two colors.at n=9A248748
• Let n have j digits {d_j, d_(j-1), ..., d_2, d_1}. Sequence lists numbers n such that R(n) = d_j^b_j + d_(j-1)^b_(j-1) + ... + d_2^b_2 + d_1^b_1 for some permutation {b_j, b_(j-1), ..., b_2, b_1} of the digits, where R(n) is the digits reverse of n.at n=11A276241
• Number of subsets of {2..n} containing the product of any set of distinct elements whose product is <= n.at n=17A308542
• E.g.f.: S(x,k) = Integral C(x,k)*D(x,k)^2 dx, such that C(x,k)^2 - S(x,k)^2 = 1, and D(x,k)^2 - k^2*S(x,k)^2 = 1, as a triangle of coefficients read by rows.at n=13A322230
• Number of equivalence classes of convex lattice polygons of genus n.at n=17A322343
• Triangle read by rows: T(m,n) is the label of the ending square of an (m,n)-leaper (a generalization of a chess knight) when it can no longer move, starting on a board with squares spirally numbered, starting at 1; 1 <= n < m. Each move is to the lowest-numbered unvisited square.at n=40A323750
• E.g.f.: S(x,k) = -i * sn( i * Integral C(x,k) dx, k) such that C(x,k) = cn( i * Integral C(x,k) dx, k), where S(x,k) = Sum_{n>=0} Sum_{j=0..n} T(n,j) * x^(2*n+1)*k^(2*j)/(2*n+1)!, as a triangle of coefficients T(n,j) read by rows.at n=11A325220
• Number of 3-sided prudent polygons of area n.at n=12A348838