224640

Appears in sequences

• Number of self-avoiding n-step walks on Kagome lattice.at n=12A001665
• a(n) = n!/LCM{1, C(n-1,1), C(n-2,2), ..., C(n-[ n/2 ],[ n/2 ])}.at n=13A025562
• a(n) = floor( n*(n+1)*(n+2)*...*(n+6) / (n+(n+1)+(n+2)+...+(n+6)) ).at n=8A032774
• Integer quotients n(n+1)(n+2)...(n+6) / (n+(n+1)+(n+2)+...+(n+6)).at n=7A032776
• a(n) = [n/1][n/2][n/3] ...[n/n] / n^(tau(n)/2).at n=26A076891
• a(0)=0, a(1)=1; thereafter a(n) = ceiling((3/2)^(n-3)*n*(n-1)).at n=19A120414
• Array T(n,k) read by antidiagonals: number of primitive polynomials of degree k over GF(prime(n)).at n=60A158502
• The sum of the two numbers in an amicable pair, A002025(n) + A002046(n).at n=13A180164
• 1/20 of the number of (n+1) X (n+1) 0..4 arrays with every 2 X 2 subblock strictly increasing clockwise or counterclockwise with one decrease.at n=4A183711
• 1/20 of the number of (n+1) X 6 0..4 arrays with every 2X2 subblock strictly increasing clockwise or counterclockwise with one decrease.at n=4A183715
• T(n,k) = 1/20 of the number of (n+1) X (k+1) 0..4 arrays with every 2 X 2 subblock strictly increasing clockwise or counterclockwise with one decrease.at n=40A183719
• Greatest common divisors of consecutive floor-factorial numbers (A010786).at n=25A208448
• a(0) = a(1) = 1, a(n) = n! / a(n-2).at n=13A214916
• The sum (in nondecreasing order) of the two numbers in an amicable pair.at n=13A259953
• Triangle T(n, k) read by rows: row n gives for n >= 0 the coefficients of the exponential numerator polynomial used for the exponential generating function of {Sum_{j=1..m} (1 + 2*j)^n}_{m>=0}.at n=32A282628
• Numbers whose infinitary divisors have a mean infinitary abundancy index that is larger than 2.at n=23A374788
• Numbers k such that k divides sigma(A003961(k)), where A003961 is fully multiplicative with a(p) = nextprime(p), and sigma is the sum of divisors function.at n=40A389469