a(1) = a(2) = 1; for n >= 2, a(n+1) = a(n) + a(j(n)) where j(m) = largest divisor of m that is < m.

A080655

a(1) = a(2) = 1; for n >= 2, a(n+1) = a(n) + a(j(n)) where j(m) = largest divisor of m that is < m.

Terms

    a(0) =1a(1) =1a(2) =2a(3) =3a(4) =4a(5) =5a(6) =7a(7) =8a(8) =11a(9) =13a(10) =17a(11) =18a(12) =23a(13) =24a(14) =31a(15) =35a(16) =43a(17) =44a(18) =55a(19) =56a(20) =69a(21) =76a(22) =93a(23) =94a(24) =112a(25) =116a(26) =139a(27) =150a(28) =174a(29) =175

External references