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.
A174162
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) =5a(2) =11a(3) =23a(4) =47a(5) =19a(6) =3a(7) =7a(8) =29a(9) =59a(10) =17a(11) =103a(12) =619a(13) =2477a(14) =991a(15) =661a(16) =3967a(17) =2267a(18) =907a(19) =191a(20) =383a(21) =13a(22) =53a(23) =107a(24) =43a(25) =173a(26) =347a(27) =139a(28) =31a(29) =83
External references
- oeis: A174162