OFFSET
1,3
COMMENTS
Are there infinitely many primes in this sequence? See A005105.
If m is a term then also 2*m + 1 and 3*m + 2.
LINKS
Graham Everest, Peter Rogers, and Thomas Ward, A higher-rank Mersenne problem, Algorithmic Number Theory: 5th International Symposium, ANTS-V Sydney, Australia, July 7-12, 2002 Proceedings 5, Lect. Notes Computer Sci. 2369, Springer Berlin Heidelberg, 2002, pp. 95-107.
FORMULA
a(n) = A003586(n)-1.
MATHEMATICA
With[{max = 4000}, Sort[Flatten[Table[2^i*3^j - 1, {i, 0, Log2[max]}, {j, 0, Log[3, max/2^i]}]]]] (* Amiram Eldar, Jul 13 2023 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Mar 18 2002
STATUS
approved