57675

Appears in sequences

• Palindromic in bases 4 and 10.at n=15A029961
• Palindromic Super-3 Numbers.at n=8A032751
• Number of n X n matrices over GF(5) under row and column permutations.at n=3A052272
• Number of 3 X 3 matrices with entries mod n, up to row and column permutation.at n=4A058001
• Triangle a(n,m)=number of m-element antichains on a labeled n-set; number of monotone n-variable Boolean functions with m mincuts (lower units), m=0..binomial(n,floor(n,2)).at n=43A059119
• Positive integers k such that k!!! - 1 = A007661(k) - 1 is prime.at n=25A084438
• Number A(n,k) of inequivalent n X n matrices with entries from [k], where equivalence means permutations of rows or columns; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=39A246106
• Numbers that are the sum of ten fifth powers in three or more ways.at n=27A345635
• Numbers that are the sum of ten fifth powers in exactly three ways.at n=23A346348
• Square array T(n,k): row n lists the number of inequivalent matrices over Z/nZ, modulo permutations of rows and columns, of size r X c, 1 <= r <= c, c >= 1.at n=49A353585
• a(n) is the smallest number k > 1 such that, in the interval 1..k, there are as many integers that have exactly 2n divisors as there are primes (or -1 if no such number exists).at n=5A356136