20684

Appears in sequences

• Sum of logarithmic numbers.at n=6A002745
• For even k >= 4, let f(k) = A066285(k/2) be the minimal difference between primes p and q whose sum is k. Such a k is in the sequence if f(k) > f(m) for all even m with 4 <= m < k.at n=26A065978
• Partial sums of A005200.at n=10A173765
• Number of (n+1)X4 binary arrays with no 2X2 subblock commuting with any of its horizontal and vertical 2X2 subblock neighbors.at n=3A187723
• Number of (n+1)X5 binary arrays with no 2X2 subblock commuting with any of its horizontal and vertical 2X2 subblock neighbors.at n=2A187724
• T(n,k)=Number of (n+1)X(k+1) binary arrays with no 2X2 subblock commuting with any of its horizontal and vertical 2X2 subblock neighbors.at n=17A187729
• T(n,k)=Number of (n+1)X(k+1) binary arrays with no 2X2 subblock commuting with any of its horizontal and vertical 2X2 subblock neighbors.at n=18A187729
• Number of (n+2) X (3+2) 0..1 arrays with every 2 X 2 and 3 X 3 subblock diagonal maximum minus antidiagonal minimum nondecreasing horizontally and vertically.at n=12A253505
• Partial sums of A255283.at n=49A255428
• Expansion of Product_{k>=1} (1 - x^(8*(2*k-1))) * (1 - x^(8*k)) / (1 - x^k).at n=40A280938
• Let n be even; m = n/2 and p a prime such that p<=m with n-p nonprime. The sequence contains the successive positive maxima of values n with L = primepi(m-1)-primepi(p+1)> 0.at n=15A293858
• a(n) = Sum_{k=1..n} k^2*tau(k), where tau is A000005.at n=23A319085
• Number of ways to split an n-cycle into connected subgraphs, all having at least three vertices.at n=26A323951
• Number of regions in the planar Farey Ring graph FR(n) defined in A359116, including the regions between the convex hull and the bounding circle.at n=8A359117
• Number of vertices among all distinct circles that can be constructed from a 2 x n square grid of points using only a compass.at n=8A359859