28011

Appears in sequences

• Define two sequences by A_n = mex{A_i,B_i : 0 <= i < n} for n >= 0, B_0=0, B_1=1 and for n >= 2, B_n = 2B_{n-1}+(-1)^{A_n}. Sequence gives B_n.at n=15A080241
• Expansion of psi(x^6) / psi(-x) in powers of x where psi() is a Ramanujan theta function.at n=49A132217
• Number of nX4 0..1 arrays with rows and columns lexicographically nondecreasing and every element equal to at least one horizontal or vertical neighbor.at n=7A201349
• T(n,k)=Number of nXk 0..1 arrays with rows and columns lexicographically nondecreasing and every element equal to at least one horizontal or vertical neighbor.at n=58A201353
• Expansion of f(-x, -x^5) * f(x, x^7) / f(-x, -x^2)^2 in powers of x where f(, ) is Ramanujan's general theta function.at n=24A262146
• Expansion of f(-x^6)^3 / (f(x)^2 * psi(x)) in powers of x where psi(), f() are Ramanujan theta functions.at n=16A262156
• Anagrasum integers: integers N that exactly reproduce their set of digits when we form the set of sums of pairs of adjacent digits.at n=47A296521
• The number of connected weighted cubic graphs with weight n on 8 vertices.at n=12A321307
• Least MM-number of a multiset of multisets with n distinct representatives obtainable by permuting the vertices.at n=4A330230
• Least MM-numbers of multisets of multisets with a given number of distinct representatives (obtainable by vertex-permutations).at n=4A330233