48450

Appears in sequences

• a(n) = 5*binomial(2n, n-2)/(n+3).at n=8A000344
• Number of nonequivalent dissections of an n-gon into n-4 polygons by nonintersecting diagonals up to rotation.at n=8A003445
• a(n) = (2*n-1)*(3*n-1)*(4*n-1).at n=13A033589
• Triangle T(n,k), k>=0 and n>=1, read by rows defined by: T(n,k) = (2k+3)*binomial(2n,n-k-1)/(n+k+2).at n=46A050155
• A sequence derived from pentagonal numbers, or a Stirling number of the first kind matrix.at n=24A094952
• Row maximum of Catalan triangle with zeros (A053121), i.e., maximum value of (m+1)*binomial(n+1,(n-m)/2)/(n+1) for given n with m same parity as n.at n=20A101461
• A number triangle of lattice walks.at n=46A107842
• Triangle read by rows: T(n,k) is the number of Motzkin paths of length n having k ascents (0<=k<=floor(n/2)); an ascent is a maximal string of upsteps.at n=59A114580
• Triangle, read by rows, defined by: T(n,k) = (4*k+1)*binomial(2*n+1, n-2*k)/(2*n+1) for n >= 2*k >= 0.at n=31A119245
• 9th column of Catalan triangle A009766.at n=4A124087
• Numbers n such that the sum of the distinct prime divisors of n that are congruent to 1 mod 4 equals the sum of the distinct prime divisors congruent to 3 mod 4.at n=28A215949
• Number of ballot sequences of length n having 8 largest parts.at n=12A244105
• Partial sums of A263614 starting at n=2.at n=49A263615
• a(n) = A273059(4n+3).at n=38A275919
• Triangle read by rows: T(n,k) = number of nonequivalent dissections of an n-gon into k polygons by nonintersecting diagonals up to rotation.at n=63A295633
• Numbers x such that sigma(x) = sigma(y), with x<>y, where y is the 10's complement mod 10 of the digits of x.at n=18A300447
• Number of integer partitions of the n-th Fermi-Dirac prime into Fermi-Dirac primes.at n=25A316210
• a(n) = Sum_{k=1..n-1} lcm(lcm(n, k), lcm(n, n-k)).at n=29A338798
• Arises from enumeration of a certain class of partial zig-zag knight's paths on the square grid.at n=19A368380