28952

Appears in sequences

• 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=51A185718
• Half the number of n X n binary arrays with no 3X3 submatrix formed with any three rows and columns equal to J-I.at n=3A213412
• Half the number of n X 4 binary arrays with no 3 X 3 submatrix formed with any three rows and columns equal to J-I.at n=3A213414
• T(n,k) = Half the number of n X k binary arrays with no 3 X 3 submatrix formed with any three rows and columns equal to J-I.at n=24A213418
• Number of idempotent 3 X 3 -n..n matrices.at n=9A223455
• Number of arrays of the median of three adjacent elements of some length-6 0..n array.at n=12A228741
• Number of nX5 0..1 arrays with exactly n+5-1 having value 1 and no three 1s forming an isosceles right triangle.at n=9A272962
• Number of n X 2 0..1 arrays with rows in nondecreasing lexicographic order and columns in nonincreasing lexicographic order, but with exactly one mistake.at n=13A278670
• Nonnegative values x of solutions (x, y) to the Diophantine equation x^2 + (x + 47^2)^2 = y^2.at n=9A332000
• a(n) is the number of tilings of a bracelet of length 2n with 1 color of 5-minoes and 6-minoes, 2 colors of 7-minoes and 8-minoes, 3 colors of 9-minoes and 10-minoes, and so on.at n=13A334047
• Number of Latin squares of order 2n with maximum inner distance with fixed entry 1 in cell (1,1).at n=12A350453