a(1) = 2; for n>1, a(n) is the smallest integer > a(n-1) such that all primes <= a(n-1) divide at least one integer k for a(n-1) < k <= a(n).
A113117
a(1) = 2; for n>1, a(n) is the smallest integer > a(n-1) such that all primes <= a(n-1) divide at least one integer k for a(n-1) < k <= a(n).
Terms
- a(0) =2a(1) =4a(2) =6a(3) =10a(4) =15a(5) =26a(6) =46a(7) =86a(8) =166a(9) =326a(10) =634a(11) =1262a(12) =2518a(13) =5006a(14) =10006a(15) =19946a(16) =39874a(17) =79738a(18) =159398a(19) =318778a(20) =637502a(21) =1274998a(22) =2549978a(23) =5099902a(24) =10199786a(25) =20399534a(26) =40799062a(27) =81598082a(28) =163196134a(29) =326392258
External references
- oeis: A113117