105936

Appears in sequences

• If A is a set of integers, the (2-fold) sumset consists of all the numbers which can be written as the sum of two (not necessarily distinct) elements in A. a(n) is the number of subsets of [1,2n] which are sumsets for some set of positive integers.at n=17A120411
• Numbers x such that 0 < |x^11 - y^7| < x^(59/7) for some number y.at n=2A173372
• Number of nX3 0..1 arrays avoiding 0 1 0 horizontally and 1 0 1 vertically.at n=6A206878
• Number of nX7 0..1 arrays avoiding 0 1 0 horizontally and 1 0 1 vertically.at n=2A206882
• T(n,k)=Number of nXk 0..1 arrays avoiding 0 1 0 horizontally and 1 0 1 vertically.at n=38A206883
• T(n,k)=Number of nXk 0..1 arrays avoiding 0 1 0 horizontally and 1 0 1 vertically.at n=42A206883
• Number of nX7 0..1 arrays avoiding 0 1 0 horizontally and 0 1 1 vertically.at n=2A206999
• T(n,k)=Number of nXk 0..1 arrays avoiding 0 1 0 horizontally and 0 1 1 vertically.at n=38A207000
• Number of n X n arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 n X n array.at n=5A219909
• Number of n X 6 arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 n X 6 array.at n=5A219913
• Number of 6Xn arrays of the minimum value of corresponding elements and their horizontal, diagonal, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 6Xn array.at n=5A219919
• Expansion of e.g.f. 1 / (1 + 3 * log(1 - x))^(4/3).at n=5A375946