26695
domain: N
Appears in sequences
- Number of partitions of n in which each even part has odd multiplicity.at n=42A130126
- a(n) = prime(prime(n*n) - n*n) - n*n where prime(n) is the n-th prime.at n=21A141127
- Triangle T(n, k) = Numbers of inequivalent (mod D_3) ways to place k points on a triangular grid of side n so that no three of them are vertices of an equilateral triangle of any orientation. Triangle read by rows.at n=36A243141
- T(n,k) is the number of non-equivalent distinguishing coloring partitions of the cycle on n vertices with exactly k parts. Regular triangle read by rows, n >= 1, 1 <= k <= n.at n=72A309784
- G.f.: Sum_{k>=0} x^(k^4) / Product_{j=1..k^4} (1 - x^j).at n=55A339235
- Number T(n,k) of partitions of [n] having k blocks containing their own index when blocks are ordered with decreasing largest elements; triangle T(n,k), n>=0, 0<=k<=ceiling(n/2), read by rows.at n=44A350647
- Numbers k such that k + sopfr(k) is a cube.at n=23A389862