24745

Appears in sequences

• Convolution of (1, p(1), p(2), ...) and composite numbers.at n=29A023627
• The number phi_2(n) of Frobenius partitions that allow up to 2 repetitions of an integer in a row.at n=28A053993
• Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+167)^2 = y^2.at n=10A130608
• Number of (n+1) X 3 0..6 arrays with every 2 X 2 subblock summing to 12.at n=2A183665
• Number of (n+1) X 4 0..6 arrays with every 2 X 2 subblock summing to 12.at n=1A183666
• T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with every 2X2 subblock summing to 12.at n=7A183672
• T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with every 2X2 subblock summing to 12.at n=8A183672
• Number of nX(n+1) arrays of permutations of n+1 copies of 0..n-1 with every element equal to or 1 greater than any north or west neighbors modulo n and the upper left element equal to 0.at n=5A268117
• Number of 6Xn arrays containing n copies of 0..6-1 with every element equal to or 1 greater than any north or west neighbors modulo 6 and the upper left element equal to 0.at n=6A268122
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 865", based on the 5-celled von Neumann neighborhood.at n=27A273701