23064

Appears in sequences

• Number of partitions satisfying cn(2,5) <= cn(1,5) + cn(4,5) and cn(3,5) <= cn(1,5) + cn(4,5).at n=38A039891
• Numbers n such that n through n+5 have the same number of distinct prime factors.at n=28A045934
• Sin(n) decreases monotonically to -1.at n=37A046964
• a(0)=1; a(n) is the smallest integer > a(n-1) such that sin(a(n)) is closer to an integer (here 0 or -1) than sin(a(n-1)).at n=36A079037
• a(1) = 1, and for each n >=2, a(n) is the smallest number such that 1/cos(a(n)) < 1/cos(k) for all k < n, so that 1/cos(a(1)) > 1/cos(a(2)) > ... > 1/cos(a(n)) > ...at n=36A172448
• Number of steps to compute the n-th prime in PRIMEGAME using Kilminster's Fractran program with only nine fractions.at n=10A183133
• Number of (n+1)X(n+1) binary arrays with no 2X2 subblock sum equal to any horizontal or vertical neighbor 2X2 subblock sum.at n=4A185789
• Number of (n+1)X6 binary arrays with no 2X2 subblock sum equal to any horizontal or vertical neighbor 2X2 subblock sum.at n=4A185794
• T(n,k) = Number of (n+1) X (k+1) binary arrays with no 2 X 2 subblock sum equal to any horizontal or vertical neighbor 2 X 2 subblock sum.at n=40A185798
• a(n) = 24*n^2.at n=31A195824
• Smallest area of triangle with integer sides and area = n times perimeter.at n=30A289155
• Number of points that are the intersections of exactly two semicircles in the configuration A290447(n).at n=30A292103
• Number of sets of nonempty multisets of nonempty sets of positive integers with total sum n.at n=14A330455