114075
domain: N
Appears in sequences
- a(n) = n^2*(n^2 - 1)/4.at n=26A006011
- a(n) is the least k > 0 such that k and 3k are anagrams in base n (written in base 10).at n=22A023095
- A partition product of Stirling_1 type [parameter k = 3] with biggest-part statistic (triangle read by rows).at n=37A157393
- A partition product of Stirling_2 type [parameter k = 3] with biggest-part statistic (triangle read by rows).at n=37A157403
- Triangular array read by rows: T(n,k) is the number of endofunctions f:{1,2,...,n}-> {1,2,...,n} whose largest component has exactly k nodes; n>=1, 1<=k<=n.at n=37A209324
- Numbers whose square is both a sum and a difference of two positive cubes.at n=24A230716
- Triangle read by rows: T(n,k) is the number of subpermutations of an n-set, whose orbits are each of size at most k with at least one orbit of size exactly k, and without fixed points. Equivalently, T(n,k) is the number of partial derangements of an n-set each of whose orbits is of size at most k with at least one orbit of size exactly k, and without fixed points.at n=47A261765