The smallest prime p that with its successor q gives prime counts of all ten base-10 digits for the expression (q^prime(n))*(p^prime(n+1)).
A217565
The smallest prime p that with its successor q gives prime counts of all ten base-10 digits for the expression (q^prime(n))*(p^prime(n+1)).
Terms
- a(0) =33581a(1) =673a(2) =571a(3) =1987a(4) =915199a(5) =441799a(6) =2115761a(7) =961943a(8) =15406687a(9) =77123341a(10) =4098427a(11) =5526679a(12) =54560189a(13) =22291639a(14) =371594479a(15) =126499693a(16) =229299227a(17) =103196347a(18) =37851677a(19) =1198387109a(20) =801422893a(21) =966240103a(22) =281430131a(23) =926679973a(24) =154019941a(25) =196449137a(26) =243985993
External references
- oeis: A217565