126000

Appears in sequences

• Orders of noncyclic simple groups (without repetition).at n=32A001034
• Number of labeled ordered set partitions into 5 parts for n>=1, a(0)=1.at n=8A001118
• Order of largest (finite) group with n conjugacy classes.at n=13A002319
• Losing initial positions in game: two players alternate in removing >= 1 stones; last player wins; first player may not remove all stones; each move <= 3 times previous move.at n=35A003411
• Triangle of numbers T(n,k) = k!*Stirling2(n,k) read by rows (n >= 1, 1 <= k <= n).at n=32A019538
• a(n) = n^2*(n+1)*(n+3)!/48.at n=5A037961
• Numbers n such that A048767(n) = n.at n=43A048768
• Number of ordered labeled rooted trees on n nodes with non-leaf nodes having more than two children.at n=7A052524
• Smallest losing position after your opponent has taken k stones in a variation of "Fibonacci Nim".at n=31A054736
• Number of primitive (aperiodic) words of length n which contain exactly five different symbols.at n=7A056270
• Number of palindromes of length n using exactly five different symbols.at n=14A056456
• Number of palindromes of length n using exactly five different symbols.at n=15A056456
• Number of primitive (aperiodic) palindromes using exactly five different symbols.at n=15A056466
• Number of primitive (aperiodic) palindromes using exactly five different symbols.at n=14A056466
• Number of periodic palindromes using exactly five different symbols.at n=14A056491
• Number of primitive (period n) periodic palindromes using exactly five different symbols.at n=14A056501
• Numbers k such that phi(k) = 2*tau(k)^2.at n=37A068564
• T(n, k) = Sum_{j=0..n-k} (-1)^j*binomial(n - k + 1, j)*(n - k + 1 - j)^n. Triangle read by rows, T(n, k) for 1 <= k <= n.at n=31A090582
• Numbers containing squares of Pythagorean triples in their divisor set.at n=34A096472
• Triangle read by rows: T(n,h) = number of functions f:{1,2,...,n}->{1,2,...,n-2} such that |Image(f)|=h, h=1,2,...,n-2; n=3,4,....at n=13A101821