30573

Appears in sequences

• a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(3) = 4.at n=17A049931
• If p(x) is the x-th prime, then the n-th set of 4 consecutive sexy prime pairs starts at p(a(n)).at n=35A095963
• Number of circular permutations of (0,1,...,n-1) with no consecutive triples i,i+d,i+2d for all d>0.at n=8A174082
• -3-Knödel numbers.at n=32A225507
• Number of partitions of n into 8 distinct and relatively prime parts.at n=50A340719
• G.f. A(x) satisfies: A(x) = 1 + x + x^2 + x^3 + x^4 * A(x/(1 - x)) / (1 - x)^2.at n=15A351707
• a(n) is the number of distinct pairs that can be made in exactly n iterations of either of the two maps (x, y) -> (x OR (2^y), 0) or (x, y) -> (x, y+1), starting from (0,0).at n=37A353150