46620

Appears in sequences

• Number of simplices in barycentric subdivision of n-simplex.at n=3A005463
• a(n) = n*(n-1)*(n-2) (or n!/(n-3)!).at n=37A007531
• Numbers n such that phi(n) + 6 | sigma(n).at n=19A015797
• a(n) = 6^n - n^2.at n=6A024064
• a(n) = 4^(n-1) - 3*3^(n-1) + 3*2^(n-1) - 1 (essentially Stirling numbers of second kind).at n=8A028244
• Triangular array a(n,k) = (1/k)*Sum_{i=0..k} (-1)^(k-i)*binomial(k,i)*i^n; n >= 1, 1 <= k <= n, read by rows.at n=39A028246
• a(n) = lcm(n,n+1,n+2).at n=34A033931
• Number of k-simplices in the first derived complex of the standard triangulation of an n-simplex. Equivalently, T(n,k) is the number of ascending chains of length k+1 of nonempty subsets of the set {1, 2, ..., n+1}.at n=30A053440
• Number of 3 X 3 integer matrices with elements in the range [ -n,n ] which generate a group of order four under binary matrix multiplication.at n=3A054467
• a(n) = n^n - n^2 with 0^0=1.at n=6A058126
• a(n) = Sum_{r|n, s|n, t|n, r<s<t} r*s*t.at n=39A067817
• a(n)=phi(n^2+1)/n if (n^2+1) is composite and phi(n^2+1)==0 (mod n).at n=40A067926
• Numbers k such that phi(k) = 2*tau(k)^2.at n=31A068564
• a(n) = (2n+1)*(2n+2)*(2n+3).at n=17A069072
• a(n) = (4*n-1)*4*n*(4*n+1).at n=9A069140
• (Sum of digits of n)^6 - (sum of digits of n^6).at n=24A069980
• Least number k such that k! in binary representation contains a run of exactly n consecutive ones.at n=33A094009
• a(n) = (3*n-1) * 3*n * (3*n+1).at n=11A097321
• First differences of sequence defined in A101172. Also, the Mobius transform of that sequence.at n=17A101173
• Smallest number not yet used that is either a divisor or multiple of both n and a(n-1).at n=36A119862