1382400

Appears in sequences

• Partial products of pi(n), A000720.at n=12A046993
• Number of 3-fold-free subsets of {1, 2, ..., n}.at n=23A050293
• a(n) = ((n+1)!*(2*n+1)!/4) * [x^(2*n-2)] 1/sin(x)^2.at n=5A080325
• Numbers k such that k^2 + 1 is a Sarrus number (pseudoprime to base 2).at n=17A135590
• Partial products of PartitionsQ numbers (A000009).at n=11A152827
• Numbers k such that rad(k)^2 divides sigma(k).at n=27A173615
• Number of fixed proper tree 4-dimensional polycubes.at n=7A192076
• Number of nX7 0..3 arrays with no element equal to another at a city block distance of exactly two, and new values 0..3 introduced in row major order.at n=9A222837
• Composite numbers m such that Product_{i=1..k} (p_i/(p_i-1)) / Sum_{i=1..k} (p_i/(p_i+1)) is an integer, where p_i are the k prime factors of m (with multiplicity).at n=33A230112
• Numbers m such that m^2 + 1 divides 2^m - 1.at n=6A247165
• Number of (n+2)X(2+2) 0..1 arrays with nondecreasing sum of every three consecutive values in every row and column.at n=5A251188
• Number of (n+2)X(6+2) 0..1 arrays with nondecreasing sum of every three consecutive values in every row and column.at n=1A251191
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with nondecreasing sum of every three consecutive values in every row and column.at n=22A251192
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with nondecreasing sum of every three consecutive values in every row and column.at n=26A251192
• Number of fixed tree polycubes of size n that are proper in n-4 dimensions.at n=4A259017
• Multiply a(n) by the first digit of a(n+1) to get a(n+2). The sequence starts with a(1) = 1 and a(2) = 2.at n=28A300759
• Row sums of A341111.at n=5A341110
• Array read by antidiagonals: T(n,k) = n^3*k^3*(n+k)^2, n>=1, k>=1.at n=39A358293
• Array read by antidiagonals: T(n,k) = n^3*k^3*(n+k)^2, n>=1, k>=1.at n=41A358293
• Triangle read by rows: T(n,k) = n^3*k^3*(n+k)^2, n>=0, 0 <= k <= n.at n=25A358294