18128
domain: N
Appears in sequences
- Numbers n of the form k + reverse(k) for exactly two k.at n=35A072040
- Triangle read by rows: T(n,k) (0 <= k <= n) = numerator of Integral_{x=0..n} binomial(x,k).at n=42A241186
- Number of ways to choose an odd partition of each part of an odd partition of 2n+1.at n=12A279374
- Number of ways to choose a partition, with odd parts, of each part of a partition of n into odd parts.at n=25A300301
- Let m(k) be the index of the largest triangular number <= k; then a(n) is the smallest number k that can be written as the sum of three triangular numbers if the largest is the (m(k)-n)-th triangular number, but no larger.at n=16A331753
- Triangle read by rows. T(n, k) = A355776(n, k) + A355777(n, k). Refining A174159, the Euler minus Narayana/Catalan triangle.at n=61A356113
- Number of minimal total dominating sets in the n-Pell graph.at n=3A379571
- Infinite square array, where row r >= 0 is the orbit of r under the map A380873: concatenate(sum of digits, product of digits).at n=73A380872