19938
domain: N
Appears in sequences
- Numbers k such that x = 2^k-2 satisfies phi(x)+2 = phi(x+2).at n=23A050475
- Conjecturally, the largest k such that prime(n)^2 is the largest squared prime divisor of binomial(2k,k).at n=37A239623
- Number of inequivalent binary linear codes of length n minus 2^n.at n=12A250003
- Number of length 3 1..(n+1) arrays with every leading partial sum divisible by 2, 3, 5, 7 or 11.at n=33A254950
- Number of subset-sums of integer partitions of n.at n=22A304792
- G.f. A(x) satisfies: A(x) = A(x^2) / (1 - x - x^2 - x^3).at n=16A309702
- a(n) = coefficient of x^n in A(x) such that: A(x)^2 = A( x^2/(1 - 4*x - 4*x^2) ).at n=7A357547