23565

Appears in sequences

• Number of Sophie Germain primes <= prime(2^n).at n=17A060200
• Let P(A) be the power set of an n-element set A. Then a(n) = the number of pairs of elements {x,y} of P(A) for which either 0) x and y are disjoint and for which either x is a subset of y or y is a subset of x, or 1) x and y are intersecting but for which x is not a subset of y and y is not a subset of x.at n=8A134018
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 165", based on the 5-celled von Neumann neighborhood.at n=32A270459
• Number of n X 2 0..1 arrays with rows and columns in lexicographic nondecreasing order but with exactly three mistakes.at n=7A278379
• T(n,k)=Number of nXk 0..1 arrays with rows and columns in lexicographic nondecreasing order but with exactly three mistakes.at n=37A278385
• T(n,k)=Number of nXk 0..1 arrays with rows and columns in lexicographic nondecreasing order but with exactly three mistakes.at n=43A278385
• a(n) = a(n-2) + 2*a(n-3) for n >= 3, where a(0) = 2, a(2) = 4, a(3) = 5.at n=22A288668
• Number of nX7 0..1 arrays with every element equal to 1, 2 or 3 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=2A301950
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2 or 3 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=38A301951
• Number of 3Xn 0..1 arrays with every element equal to 1, 2 or 3 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=6A301952
• The smallest k >= 0 that can be represented as a linear combination of 1^2, 2^2, ..., n^2 with coefficients +-1 and that cannot be represented using 1^2, 2^2, ..., m^2 with 1<=m<n.at n=41A392127