612612

Appears in sequences

• Denominator of 2*Sum(C(n,w)/w,w=1..n/2-1)+C(n, n/2)/(n/2) if n is even otherwise of 2*Sum(C(n,w)/w,w=1..(n-1)/2).at n=34A085572
• Denominator of 2*Sum(C(n,w)/w,w=1..n/2-1)+C(n, n/2)/(n/2) if n is even otherwise of 2*Sum(C(n,w)/w,w=1..(n-1)/2).at n=35A085572
• Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by the n-th Catalan number (A000108).at n=49A085880
• Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by the n-th Catalan number (A000108).at n=50A085880
• a(n) = 14*binomial(n,8).at n=18A088625
• Sixth column (m=5) of (1,4)-Pascal triangle A095666.at n=32A095668
• a(n) = lcm{1, 2, ..., n}/(n*(n-1)), n >= 2.at n=18A099946
• The first term is 256; each subsequent term in the series is computed by translating the previous term to binary, then reinterpreting the binary expansion as a product of metaprimes. Metaprimes follow the form p^(2^n) where p is a prime number and n is a nonnegative integer. See the link for more detailed explanation.at n=7A133487
• Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of 2 n steps taken from {(-1, 0), (1, -1), (1, 1)}.at n=9A151379
• Triangle read by rows: T(n,k) = binomial(2*n,2*k)*binomial(2*n-2*k,n-k)/(n+1-k) for 0<=k<=n.at n=50A280580
• Bi-unitary highly composite deficient numbers: bi-unitary deficient numbers k whose number of bi-unitary divisors bd(k) > bd(m) for all bi-unitary deficient numbers m < k.at n=11A302936
• a(n) = (2/((n+1)*(n+2)))*multinomial(3*n;n,n,n).at n=6A324151
• Triangle read by rows: T(n,m)=4^(n-1)*C(n,m)*C(3*n/2-2,n-1)/n, for 0 <= m <= n, with T(0,0)=1.at n=30A360667
• Triangle read by rows: T(n,m)=4^(n-1)*C(n,m)*C(3*n/2-2,n-1)/n, for 0 <= m <= n, with T(0,0)=1.at n=33A360667
• Numbers that when concatenated with the natural numbers from 1 to N are divisible by the corresponding order number.at n=8A360830