68796

Appears in sequences

• a(n) = (1/(2n+1))*Multinomial(3n; n,n,n).at n=5A024486
• Numbers n such that phi(n) = product of the digits of n.at n=14A058627
• Matrix inverse of the Narayana triangle A001263.at n=40A103364
• a(n) is the smallest number representable in exactly n ways as a sum of 2 powerful(1) numbers.at n=17A115354
• Sigma(A033631(n)) {sigma is the sum of divisors function A000203}.at n=11A115619
• Triangle read by rows: (1/5) * (A007318^4 - A007318^(-1)) as infinite lower triangular matrices.at n=39A131050
• Convolution square of A003114.at n=46A145467
• Number of ways to place 3 nonattacking knights on an n X n board.at n=8A172134
• Number of ways to place 4 nonattacking knights on an n X n toroidal board.at n=6A172531
• Numbers with prime factorization p*q^2*r^2*s^3 (where p, q, r, s are distinct primes).at n=32A190109
• Number of (w,x,y,z) with all terms in {1,...,n} and w<2x and y>3z.at n=28A212510
• Number of (w,x,y,z) with all terms in {1,...,n} and w<=2x and y<3z.at n=18A212512
• Number of (w,x,y,z) with all terms in {0,...,n}, w odd, x and y even.at n=26A212761
• Number of n X 4 0..1 arrays with rows and columns unimodal and antidiagonals nondecreasing.at n=11A223773
• Nonsquare numbers whose sum of proper square divisors is a square greater than 1.at n=24A232555
• Numbers whose sum of proper square divisors is a square greater than 1.at n=27A232556
• Subdiagonal partitions: number of partitions (p1, p2, p3, ...) of n with pi <= i.at n=48A238875
• Smallest integer such that the sum of its n smallest divisors is a Fibonacci number, or 0 if no such integer exists.at n=35A292467
• a(n) = n * sigma_2(n).at n=35A328259
• Triangle read by rows: T(n,k) = binomial(n+1,k+1) * binomial(4*n-3*k+1,k) / (n+1), 0<=k<=n.at n=48A391047