a(n) = gpf(a(n-3))*gpf(a(n-2)) + gpf(a(n-1)), with a(1)=a(2)=1 and a(3)=2 and where gpf(n) is the greatest prime dividing n, A006530(n).

A258804

a(n) = gpf(a(n-3))*gpf(a(n-2)) + gpf(a(n-1)), with a(1)=a(2)=1 and a(3)=2 and where gpf(n) is the greatest prime dividing n, A006530(n).

Terms

    a(0) =1a(1) =1a(2) =2a(3) =3a(4) =5a(5) =11a(6) =26a(7) =68a(8) =160a(9) =226a(10) =198a(11) =576a(12) =1246a(13) =122a(14) =328a(15) =5470a(16) =3048a(17) =22554a(18) =69648a(19) =24184a(20) =262752a(21) =4386396a(22) =70190a(23) =22222a(24) =4639830a(25) =1914046a(26) =3227106a(27) =35917950a(28) =2738592a(29) =325870

External references