37046
domain: N
Appears in sequences
- Number of length n+4 0..1 arrays with at most two downsteps in every n consecutive neighbor pairs.at n=16A256819
- Numbers k such that A019320(k) is in A217468.at n=42A297412
- Numbers k such that 2^m == 2 (mod m*(m-1)), where m=A019320(k).at n=53A297413
- a(n) is the smallest nonzero number k such that gcd(prime(1)^k + 1, prime(2)^k + 1, ..., prime(n)^k + 1) > 1 and gcd(prime(1)^k + 1, prime(2)^k + 1, ..., prime(n+1)^k + 1) = 1.at n=11A351921
- E.g.f. C(x) satisfies C(x) = exp(-x/C(x)) * C(x/C(x))^2.at n=5A383562