95931

Appears in sequences

• a(n) = 9*binomial(2n,n-4)/(n+5).at n=7A001392
• Number of irreducible alternating Euler sums of depth 6 and weight 6+2n.at n=33A011796
• a(n) = T(3n+1,n), where T = Catalan triangle (A008315).at n=7A026004
• Eighth column of Catalan triangle A009766.at n=8A064061
• Total sum of prime parts in all partitions of n.at n=30A073118
• n = k^2 - (reversal of k)^2 for two different values of k.at n=8A087672
• Triangle read by rows: T(n,k) is the number of noncrossing forests with n vertices and k components (1<=k<=n).at n=37A094021
• Triangle read by rows: T(n,k) is the number of noncrossing forests with n vertices and k edges.at n=43A094040
• a(n) = a(n-3) - 5*a(n-2) + 5*a(n-1), a(0) = 1, a(1) = 3, a(2) = 10.at n=9A102871
• a(n) = -a(n-1)+4*a(n-2)+4*a(n-3)-a(n-4)-a(n-5).at n=20A107401
• 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=38A119245
• a(n) = 121*n^2 - 204*n + 86.at n=28A157440
• Smallest number expressible in the form a^2 + 2b^2, with positive integers a and b, in exactly n ways.at n=15A200977
• Smallest number having exactly n divisors of the form 8*k + 1.at n=15A343104
• Smallest number having exactly n divisors of the form 8*k + 3.at n=16A343105
• Positions of records in A188169.at n=10A343134
• Positions of records in A188170.at n=10A343135
• a(n) is the least number k such that A246600(k) = n, and -1 if no such k exists.at n=18A359081
• Number of Young tableaux of shape [n, floor(n/2)].at n=15A368567
• a(n) is the smallest nonnegative integer k where there are exactly n nonnegative integer solutions to x^2 + 2*y^2 = k.at n=16A374285