93024

Appears in sequences

• a(n) = (5*n+1)*(5*n+2)*(5*n+3)*(5*n+4).at n=3A001512
• a(n) = n^3 + (n+1)^3 + (n+2)^3 + (n+3)^3.at n=27A027603
• a(n) = binomial(n+5,5)*(n+3)/3.at n=15A040977
• Number of certain rooted planar maps.at n=7A046647
• Triangle of rooted planar maps.at n=43A046651
• Partial sums of A051836.at n=14A051923
• Products of 4 consecutive integers: a(n) = n*(n-1)*(n-2)*(n-3).at n=19A052762
• a(n) = n*(n-1)*(n-2)*(n-3) for n>=5.at n=19A052768
• T(2n+4,n), array T as in A055794.at n=15A055797
• Let v = (1,4,9,...,n^2), x = (0,1,2,4,6,...) [first n terms of A002620]; a(n) = v.v * x.x - (v.x)^2.at n=15A060452
• Consider the line segment in R^n from the origin to the point v = (1,4,9,...,n^2); let d = squared distance to this line from the closest point of Z^n (excluding the endpoints). Sequence gives d times v.v.at n=14A060454
• Triangle read by rows: T(n,k) is the number of nonseparable planar maps with r*n edges and a fixed outer face of r*k edges which are invariant under a rotation of 1/r for any r >= 2 (independent of actual value of r).at n=37A091599
• Triangle read by rows: T(n,k) is the number of noncrossing forests with n vertices and k components (1<=k<=n).at n=38A094021
• Triangle read by rows: T(n,k) is the number of noncrossing forests with n vertices and k edges.at n=42A094040
• Prime(n)!/composite(n)!.at n=3A096074
• Consider a Pythagorean triangle with sides a=u^2-v^2, b=2uv, c=u^2+v^2. The sequence is the area of the triangle when v=2, u=3,4,5,...at n=33A096382
• Denominator of -16/((n+2)*n*(n-2)*(n-4)).at n=35A117465
• Triangle read by rows, derived from a(n) = N*a(n-1) + a(n-2).at n=24A138765
• Number of ways to select 15 knights from n knights sitting at a round table if no adjacent knights are chosen.at n=6A188225
• a(n) = Fibonacci(n)*A008653(n) for n>=1, with a(0)=1, where A008653 is the theta series of direct sum of 2 copies of hexagonal lattice.at n=18A205967