21028

Appears in sequences

• a(n) = Sum_{m=1..n} Sum_{k=1..m} prime(k).at n=32A014148
• Rounded volume of a regular dodecahedron with edge length n.at n=14A071401
• Numbers k such that k*k! - 1 is prime.at n=26A090704
• Number of nX2 0..2 arrays with no average of any element and its diagonal, antidiagonal, horizontal and vertical neighbors equal to one.at n=4A200803
• Number of nX5 0..2 arrays with no average of any element and its diagonal, antidiagonal, horizontal and vertical neighbors equal to one.at n=1A200806
• T(n,k)=Number of nXk 0..2 arrays with no average of any element and its diagonal, antidiagonal, horizontal and vertical neighbors equal to one.at n=16A200809
• T(n,k)=Number of nXk 0..2 arrays with no average of any element and its diagonal, antidiagonal, horizontal and vertical neighbors equal to one.at n=19A200809
• Number of tilings of a 5 X n rectangle using straight (3 X 1) trominoes and 2 X 2 tiles.at n=12A219969
• Those terms of A255571 whose every A080541/A080542-rotation is also a term of A255571.at n=39A258001
• Number of (n+2)X(3+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00001001.at n=6A260289
• Number of (n+2)X(7+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00001001.at n=2A260293
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00001001.at n=38A260294
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00001001.at n=42A260294
• a(n) = (2^p+1)^(p-1) modulo p^2, where p is prime(n).at n=37A260531
• Numbers n such that the decimal digits of n-phi(n) are a permutation of those of n.at n=39A273799
• Number of non-connected simple labeled graphs covering n vertices.at n=7A327070
• Number of partitions of n into colored blocks of equal parts, such that all colors from a set of size five are used and the colors are introduced in increasing order.at n=18A327288
• Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = Sum_{j=0..n} (-k)^(n-j) * j^j * binomial(n,j).at n=42A362856
• Expansion of e.g.f. exp(-2*x) / (1 + LambertW(-x)).at n=6A362857
• E.g.f. satisfies A(x) = 1 + x^2/2*exp(x*A(x)).at n=8A371063