40210
domain: N
Appears in sequences
- Numbers k such that k | 7^k + 1.at n=12A015954
- A triangle sequence made symmetrical by reverse coefficients: t0(n,m)=(2 + n! - m! - (n - m)! + 2 + PartitionsP[n] - PartitionsP[ m] - PartitionsP[n - m]); t(n,m)=(t0(n,m)+Reverse[t0(n,m)])/2.at n=39A156046
- A triangle sequence made symmetrical by reverse coefficients: t0(n,m)=(2 + n! - m! - (n - m)! + 2 + PartitionsP[n] - PartitionsP[ m] - PartitionsP[n - m]); t(n,m)=(t0(n,m)+Reverse[t0(n,m)])/2.at n=41A156046
- Number of -n..n arrays x(0..3) of 4 elements with zero sum and elements alternately strictly increasing and strictly decreasing.at n=25A200058
- Convolutory inverse of the Thue Morse sequence.at n=32A225132
- 6th power analog of Keith numbers.at n=13A281917
- Number of nX6 0..1 arrays with every element unequal to 0, 2 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=11A317813
- Numbers k such that k mod (2, 3, 4, ... , i+1) = (d_i, d_i-1, ..., d_1), where d_1, d_2, ..., d_i are the digits of k, with MSD(k) = d_1 and LSD(k) = d_i.at n=8A319599
- G.f. A(x) satisfies: 1 = Sum_{n>=0} ((1+x)^(2*n-1) - A(x))^n.at n=5A325154