28264
domain: N
Appears in sequences
- Rounded total surface area of a regular dodecahedron with edge length n.at n=37A071397
- Triangle T(n, k) = coefficients of ( t(n, x) ) where t(n, x) = (1-x)^(n+1)*p(n, x)/x, p(n, x) = x*D( p(n-1, x) ), with p(1, x) = x/(1-x)^2, p(2, x) = x*(1+x)/(1-x)^3, and p(3, x) = x*(1+10*x+x^2)/(1-x)^4, read by rows.at n=38A166341
- Triangle T(n, k) = coefficients of ( t(n, x) ) where t(n, x) = (1-x)^(n+1)*p(n, x)/x, p(n, x) = x*D( p(n-1, x) ), with p(1, x) = x/(1-x)^2, p(2, x) = x*(1+x)/(1-x)^3, and p(3, x) = x*(1+10*x+x^2)/(1-x)^4, read by rows.at n=42A166341
- For positive n with prime decomposition n = Product_{j=1..m} (p_j^k_j) define A_n = Sum_{j=1..m} (p_j*k_j) and B_n = Sum_{j=1..m} (p_j^k_j). This sequence gives those n for which A_n and B_n are both prime and B_n = A_n + 2 (i.e., form a twin prime pair).at n=50A185718
- a(n) is the number of digits in the decimal representation of the smallest Fibonacci number that contains n consecutive identical digits.at n=9A217191
- Number of partitions of n in which any two parts differ by at most 10.at n=42A218512
- Number of length n+6 0..1 arrays with at most two downsteps in every n consecutive neighbor pairs.at n=11A256821
- Sum of the smallest parts of the partitions of n into 10 parts.at n=52A326589
- Expansion of g.f. A(x) satisfying A( sqrt(A(x)^2 - 8*A(x)^3) ) = x.at n=5A367384