19848
domain: N
Appears in sequences
- Number of hexaflexagons with 3n triangles that can be folded from a straight strip of paper.at n=8A007282
- Base-9 palindromes that start with 3.at n=22A043030
- Number of indecomposable binary self-dual codes (singly- or doubly-even) of length 2n and minimal distance exactly 4.at n=17A106166
- Index of Mersenne number A000225 that is also Mersenne prime A000668, minus n-th prime: a(n) = A000043(n) - A000040(n).at n=23A153801
- Numbers which do not reach zero under either of the iterations: x -> floor(sqrt(x)) * (x - floor(sqrt(x))^2) or y -> ceiling(sqrt(y)) * (ceiling(sqrt(y))^2 - y).at n=23A219963
- Numbers n for which A222085(n)=A222085(n+1).at n=19A222088
- Sum of the middle parts in the partitions of 4n-1 into 3 parts.at n=23A240707
- Terms of A143407, sorted.at n=39A270564
- T(n,k) = Number of n X k 0..1 arrays with the number of 1's horizontally, diagonally or antidiagonally adjacent to some 0 equal to the number of 0's adjacent to some 1, with top left element zero.at n=46A284334
- Number of 2 X n 0..1 arrays with the number of 1's horizontally, diagonally or antidiagonally adjacent to some 0 equal to the number of 0's adjacent to some 1, with top left element zero.at n=8A284335
- Expansion of Product_{k>=1} (1 + x^(k^2)) * (1 + x^k).at n=51A369570