42367

Appears in sequences

• Number of partitions of n with positive rank.at n=44A064173
• Numbers to which Mersenne primes 2^p-1 can be congruent mod k! (for k > 1).at n=12A145038
• Number of n X n 0..1 arrays with every element equal to 1, 2, 3 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=4A302664
• Number of nX5 0..1 arrays with every element equal to 1, 2, 3 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=4A302667
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=40A302670
• Number of 5Xn 0..1 arrays with every element equal to 1, 2, 3 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=4A302671
• G.f. A(x) satisfies: 2 = Sum_{n=-oo..+oo} (-x)^(n*(n+1)/2) * ((1+x)^(n+1) - 2*A(x))^n.at n=7A355155
• Numbers k such that the odd part of (1+k) divides (1+A003961(k)), where A003961 is fully multiplicative with a(p) = nextprime(p).at n=45A387411