25980

Appears in sequences

• Numbers n = concat(a,b) such that phi(n) = phi(a) * phi(b), where phi = A000010.at n=36A147619
• a(n) = 1000*n - 20.at n=25A157515
• Coefficients of numerator of recursively defined rational function: p(x,3)=x*(x^2 + 6*x + 1)/(1 - x)^4; p(x, n) = 2*x*D[p(x, n - 1), x] - p(x,n-2).at n=37A166349
• Coefficients of numerator of recursively defined rational function: p(x,3)=x*(x^2 + 6*x + 1)/(1 - x)^4; p(x, n) = 2*x*D[p(x, n - 1), x] - p(x,n-2).at n=43A166349
• Numbers k such that there is 1 prime between 100*k and 100*k + 99.at n=33A186393
• Number of 0..n arrays x(0..4) of 5 elements with nondecreasing average value.at n=11A200765
• Number of plane partitions of n where parts are colored in (at most) 5 colors.at n=5A306095
• Square array T(n,k) = number of plane partitions of n with parts colored in (at most) k colors; n >= 0, k >= 0; read by antidiagonals.at n=60A306100
• Square array T(n,k) = number of plane partitions of n with parts colored in (at most) k colors; n, k >= 1; read by antidiagonals.at n=40A306101
• Triangle read by rows: Take a hexagram with all diagonals drawn, as in A331908. Then T(n,k) = number of k-sided polygons in that figure for k = 3, 4, ..., n+5.at n=42A331909