31125
domain: N
Appears in sequences
- Numbers k such that phi(k) | sigma_10(k).at n=22A015768
- [ 3rd elementary symmetric function of {sqrt(k+1)} ], k = 1,2,...,n.at n=16A025220
- Images of hexamorphic numbers: suppose k-th hexagonal number H(k) (A000384) ends in k; sequence gives positive values of H(k).at n=9A038494
- Numbers whose base-5 representation contains exactly three 0's and three 4's.at n=29A045217
- Numbers k such that 11^k == -1 (mod k-1).at n=12A055694
- Triangular numbers whose digit reversal is the product of 2 palindromes greater than 1.at n=31A115702
- Triangular numbers for which the sum of the digits is a pentagonal number.at n=26A117305
- Hexagonal numbers (A000384) which are sum of 2 other hexagonal numbers > 0.at n=25A133215
- Numbers n with property that for each single digit d of n, we can also see the decimal expansion of the d-th prime as a substring of n. Also n may not contain any zero digits.at n=12A135015
- Triangular numbers which are sums of 5 consecutive primes.at n=8A173421
- Number of nX3 arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 nX3 array.at n=11A219910
- Triangular numbers generated in A224218. That is, the triangular numbers generated by the operation triangular(i) XOR triangular(i+1) along increasing i.at n=26A220689
- Number of n X 5 0..2 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of the sum of elements above it, modulo 3.at n=5A238809
- Number of nX6 0..2 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of the sum of elements above it, modulo 3.at n=4A238810
- T(n,k)=Number of nXk 0..2 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of the elements above it, modulo 3.at n=49A238812
- T(n,k)=Number of nXk 0..2 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of the elements above it, modulo 3.at n=50A238812
- Expansion of e.g.f. A(x) satisfying A(x) = 1 + x*A(x) * exp(3*x*A(x)).at n=5A366233