proposed
approved
Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
proposed
approved
editing
proposed
a(145) > 200000, a(146) - .. a(156) = {1, 1, 66, 1, 4, 3, 1, 1, 1, 1, 6}, a(157) > 100000, a(158) - .. a(180) = {2, 1, 2, 11, 1, 1, 3, 321, 1, 1, 3, 1, 2, 12183, 5, 1, 1, 957, 2, 3, 16, 3, 1}.
(PARI) a007494(n) = n+(n+1)>>1;
a(n) = for(k=1, 2^24, if(ispseudoprime(2*a007494(n)^k+1), return(k)));
proposed
editing
editing
proposed
editing
proposed
If n == 1 (mod 3), then for every positive integer k, 2*n^k+1 is divisible by 3 and cannot be prime (unless n=1). Thus we restrict the domain of this sequence to A007494. (n which is not in the form 3j+1).
If n ==3j+ 1, (mod 3), then all for every positive integer k, 2*n^k+1 are is divisible by 3 and cannot be prime, so (unless n=1). Thus we limited restrict the n in domain of this sequence to A007494 . (n which is not in the form 3j+1).
proposed
editing
editing
proposed