523087

Appears in sequences

• a(n) = 2*a(n-2)+4*a(n-4)+a(n-6), n>9.at n=24A107856
• a(n) is the number of numbers m such that the number of iterations of r -> r - (largest divisor d < r) needed to reach 1 starting at r = m is equal to n.at n=27A175125
• a(n) = 3*a(n-1) + a(n-2), with a(0)=4, a(1)=11.at n=10A282702