23267
domain: N
Appears in sequences
- Numbers that are the sum of 8 positive 9th powers.at n=16A003397
- Composite numbers n such that k! == 1 (mod n) for some k > 2.at n=23A049048
- Number of lower triangular n X n arrays of integers 0 upwards introduced in row major order, with each element unique in its row and column, and containing the value n(n+1)/2-4.at n=4A211887
- T(n,k)=Number of lower triangular n X n arrays of integers 0 upwards introduced in row major order, with each element unique in its row and column, and containing the value n(n+1)/2-k-1.at n=25A211888
- Number of integer partitions of n with frequency depth floor(sqrt(n)).at n=41A325252
- Number of integer partitions of n with the maximum adjusted frequency depth for partitions of n.at n=41A325254
- Number of integer partitions of n with frequency depth round(sqrt(n)).at n=41A325271
- a(n) = greatest number in row n of the array in A225485.at n=40A364810
- Row sums of A364891.at n=44A364892