25968

Appears in sequences

• Minimum sum of n distinct positive numbers, any n-1 of which sum to a square.at n=12A035305
• Numbers n such that 1 + Sum{k=1..n/2} A001223(2k-1)*(-1)^k = 0.at n=20A130642
• Numbers n such that 1 + S(n) = 0, where S(n) = (S(n-1) + A000040(n))*(-1)^n; S(0)=0, n=>1.at n=13A131196
• Triangle read by rows, A095989 convolved with A000670.at n=39A163204
• Number of (w,x,y,z) with all terms in {1,...,n} and median=mean.at n=24A212133
• Number of length 3 0..n arrays with each partial sum starting from the beginning no more than one standard deviation from its mean.at n=40A244791
• Number of (n+1)X(3+1) arrays of permutations of 0..n*4+3 filled by rows with each element moved a city block distance of 0 or 1, and rows and columns in increasing lexicographic order.at n=3A263514
• T(n,k) = Number of (n+1) X (k+1) arrays of permutations of 0..(n+1)*(k+1)-1 filled by rows with each element moved a city block distance of 0 or 1, and rows and columns in increasing lexicographic order.at n=18A263519
• Number of (4+1)X(n+1) arrays of permutations of 0..n*5+4 filled by rows with each element moved a city block distance of 0 or 1, and rows and columns in increasing lexicographic order.at n=2A263522
• Numbers k such that 24*k-1 has at least three factors 7 and the partition function evaluated at k has at least the same number of factors 7 as 24*k-1.at n=33A340957
• Number of regions formed in a square by straight line segments when connecting the n-1 points between each corner that divide each edge into n equal parts to the n-1 points on the edge on the opposite side of the square.at n=12A355798