![]() |
VOOZH | about |
OEIS Server: https://oeis.org/edit/global/2798
Michel Marcus: You could prepend 7 for n=1 and change offset to 1.
It has exactly 1 prime divisor and verifies the squarefree condition.
Since it is equal to A068088 (1) + 3.
Tom Edgar: Michel, I think he means that all of the listed integers are square free with n divisors. Thus 7,8,9,11,12,13 wouldn't work. I think n=1 won't work because if x is square free and prime then x+1 will either be nonsquarefree or will have more than one prime divisor.
Michel Marcus: Oh yes, you're right. My mistake. Big mistake.
Daniel Constantin Mayer: Same updates in PROG as in A242804, A242805, A242806, A242829.
Daniel Constantin Mayer: I regret that I had given the second term 8628052209 of the sequence A242829 originally, instead of the first term 6639266409, since the particularly hard sequence A242829 was computed in parallel processes by several machines, and the output for the interval from 6*10^9 to 7*10^9 was inadvertently overlooked in the primary evaluation.