a(n) = smallest number k > a(n-1) maximizing the number of primes in all sums a(j)+k, j=1..(n-1), with a(1)=2.
A291163
a(n) = smallest number k > a(n-1) maximizing the number of primes in all sums a(j)+k, j=1..(n-1), with a(1)=2.
Terms
- a(0) =2a(1) =3a(2) =4a(3) =9a(4) =10a(5) =27a(6) =34a(7) =69a(8) =70a(9) =429a(10) =430a(11) =1059a(12) =1484a(13) =3537a(14) =8284a(15) =65169a(16) =98464a(17) =2061999a(18) =2210564a(19) =10919799a(20) =11521580a(21) =495385137a(22) =567955604a(23) =1112946057a(24) =4926960394a(25) =365847990027
External references
- oeis: A291163