64766

Appears in sequences

• a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = a(3) = 1.at n=18A049886
• Indices of primes in sequence defined by A(0) = 61, A(n) = 10*A(n-1) + 41 for n > 0.at n=23A101531
• G.f. satisfies: x = Sum_{n>=1} 1/A(x)^(6*n) * Product_{k=1..n} (1 - 1/A(x)^k).at n=6A209442
• Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n) + 2*n, where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences.at n=18A294170