246202
domain: N
Appears in sequences
- Let f(1) = 1 + i (where i denotes the imaginary unit) and for n > 0, f(n+1) is the Gaussian prime in the first quadrant (with positive real part and nonnegative imaginary part) with least modulus that divides 1 + Product_{k=1..n} f(k) (in case of a tie minimize the imaginary part); a(n) is the imaginary part of f(n).at n=22A320104
- Number of compositions of n with cuts-resistance 2.at n=21A329863
- Number of binary necklaces of length n which have more 01 than 00 substrings.at n=19A371570