|
Search: id:A002200
|
|
|
| A002200 |
|
Primes of the form 2^q*3^r*5^s + 1.
(Formerly M0654 N0242)
|
|
+0
1
|
|
| 2, 3, 5, 7, 11, 13, 17, 19, 31, 37, 41, 61, 73, 97, 101, 109, 151, 163, 181, 193, 241, 251, 257, 271, 401, 433, 487, 541, 577, 601, 641, 751, 769, 811, 1153, 1201, 1297, 1459, 1601, 1621, 1801, 2161, 2251, 2593, 2917, 3001, 3457, 3889, 4001, 4051, 4801, 4861
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
M. Kraitchik, Recherches sur la Th\'{e}orie des Nombres. Gauthiers-Villars, Paris, Vol. 1, 1924, Vol. 2, 1929, see Vol. 1, p. 53.
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,200
|
|
PROGRAM
|
(PARI) { default(primelimit, 16600000); n=0; forprime (p=2, 16600000, m=p-1; p2=p3=p5=0; s=m; r=0; while(r==0, q=s\2; r=s-2*q; s=q; if(r==0, p2++)); s=m; r=0; while(r==0, q=s\3; r=s-3*q; s=q; if(r==0, p3++)); s=m; r=0; while(r==0, q=s\5; r=s-5*q; s=q; if(r==0, p5++)); if (m == 2^p2*3^p3*5^p5, n++; write("b002200.txt", n, " ", p)); if (n >= 200, break); ); } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), May 25 2009]
|
|
CROSSREFS
|
Adjacent sequences: A002197 A002198 A002199 this_sequence A002201 A002202 A002203
Sequence in context: A079150 A117843 A068192 this_sequence A069709 A144755 A069090
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
Better description and more terms from Vladeta Jovovic (vladeta(AT)eunet.rs), May 08 2003
|
|
|
Search completed in 0.002 seconds
|
