OFFSET
1,1
COMMENTS
The sequence is known to be infinite [Polya] - thanks to Pieter Moree and Daniel Stefankovic for this comment, Dec 21 2009.
REFERENCES
M. Kraitchik, Recherches sur la Théorie des Nombres. Gauthiers-Villars, Paris, Vol. 1, 1924, Vol. 2, 1929, see Vol. 1, p. 63.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
T. D. Noe, Table of n, a(n) for n = 1..1000
G. Polya, Arithmetische Eigenschaften der Reihenentwicklungen rationaler Funktionen, J. reine und angewandte Mathematik (Crelle), Volume 1921, Issue 151, Pages 1-31.
MAPLE
N:= 1000: # to search the first N primes
{2} union select(t -> numtheory[mlog](3, 2, p) <> FAIL, {seq(ithprime(n), n=2..N)});
# Robert Israel, Feb 15 2013
MATHEMATICA
Select[Prime[Range[120]], MemberQ[Table[Mod[2^x-3, #], {x, 0, #}], 0]&] (* Jean-François Alcover, Aug 29 2011 *)
PROG
(PARI) isok(p) = isprime(p) && sum(k=0, (p-1), Mod(2, p)^k == 3); \\ Michel Marcus, Mar 12 2017
(PARI) is(n)=isprime(n) && (n==2 || #znlog(3, Mod(2, n))) \\ Charles R Greathouse IV, Aug 15 2018
CROSSREFS
KEYWORD
nonn,easy,nice
AUTHOR
EXTENSIONS
Better description from Joe K. Crump (joecr(AT)carolina.rr.com), Dec 11 2000
More terms from David W. Wilson, Dec 12 2000
STATUS
approved