a(1) = 2. Let k >= 1 be the minimal integer such that 2*k*a(n-1) - 1 has at least one prime divisor which is not already in the sequence. Then a(n) is the smallest such divisor.
A174161
a(1) = 2. Let k >= 1 be the minimal integer such that 2*k*a(n-1) - 1 has at least one prime divisor which is not already in the sequence. Then a(n) is the smallest such divisor.
Terms
- a(0) =2a(1) =3a(2) =5a(3) =19a(4) =37a(5) =73a(6) =29a(7) =23a(8) =7a(9) =13a(10) =17a(11) =11a(12) =43a(13) =257a(14) =79a(15) =157a(16) =313a(17) =139a(18) =277a(19) =41a(20) =163a(21) =31a(22) =61a(23) =487a(24) =59a(25) =47a(26) =281a(27) =1123a(28) =449a(29) =359
External references
- oeis: A174161