49210

Appears in sequences

• a(n) = (n-3)*A006918(n-2)/2 for n >= 2, with a(0) = a(1) = 0.at n=40A038376
• Partial sums of A007585.at n=18A051797
• Nearest integer to n^6/36.at n=10A061004
• 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 have k peaks of the form ud.at n=41A108446
• Triangle read by rows: (1/4) * (A007318^3 - A007318^(-1)) as infinite lower triangular matrices.at n=46A131049
• a(n) = 36*n^2 - 2*n.at n=36A158062
• Sum of tetrahedral numbers A000292(k), with k in the reduced residue system modulo n.at n=34A189918
• Number of nonnegative integer arrays of length n+13 with new values 0 upwards introduced in order, no three adjacent elements all unequal, and containing the value 7.at n=5A211847
• Number of nonnegative integer arrays of length 2n+7 with new values 0 upwards introduced in order, no three adjacent elements all unequal, and containing the value n+1.at n=5A211852
• -2-Knödel numbers.at n=36A225506
• a(n) = ((2*n+1)^(n+1) + (-1)^n)/(n+1)^2.at n=5A273319
• a(n) = (1/24)*n*(n - 1)*(n - 3)*(n - 14).at n=38A319930
• Squarefree numbers k such that the sum of the distinct prime factors of k is twice the difference between the largest and the smallest prime factors of k.at n=40A324210
• a(n) is the number of edges formed by n-secting the angles of a decagon.at n=39A335802
• Expansion of e.g.f. x*exp(x)*(cosh(x))^2.at n=10A360023
• Expansion of e.g.f. x*exp(x)*cosh(x)*sinh(x).at n=10A360035
• a(n) = sqrt((x^2 - y^2)*x*y/c) where x is A364108(n), y is A364109(n) and c is A006991(n).at n=33A364110