Auxiliary c(n) sequence used to prove some properties about Rowland's sequence. c(n) has the following recursive definition: c(1) = 5, c_(n+1) = c(n) + lfp(c(n)) - 1, where lpf(.) denotes the lowest prime factor of a number.

A190894

Auxiliary c(n) sequence used to prove some properties about Rowland's sequence. c(n) has the following recursive definition: c(1) = 5, c_(n+1) = c(n) + lfp(c(n)) - 1, where lpf(.) denotes the lowest prime factor of a number.

Terms

    a(0) =5a(1) =9a(2) =11a(3) =21a(4) =23a(5) =45a(6) =47a(7) =93a(8) =95a(9) =99a(10) =101a(11) =201a(12) =203a(13) =209a(14) =219a(15) =221a(16) =233a(17) =465a(18) =467a(19) =933a(20) =935a(21) =939a(22) =941a(23) =1881a(24) =1883a(25) =1889a(26) =3777a(27) =3779a(28) =7557a(29) =7559

External references