45846

Appears in sequences

• a(n) = 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) = 2, and a(3) = 4.at n=33A050055
• Fourth column of A046741.at n=21A062124
• The n-almost primeth recurrence: a(0) = 1, a(n) = n-almostprime(a(n-1)).at n=6A119966