|
Search: id:A089163
|
|
|
| A089163 |
|
Second prime factor of 3^n - 2^n. |
|
+0
1
|
|
| 71, 331, 29927, 745181, 2002867877, 50642213021, 32309, 1196347, 303168989, 203778431, 17685389279, 111998979662707645844109121, 645845309, 146309, 499, 706132008101135602203621405289, 59813046375181769306016700165290169537
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
All prime factors of 3^p - 2^p, where p is prime, are = 1 (mod p).
|
|
LINKS
|
Chris Caldwell, MersenneNumbers History.
|
|
EXAMPLE
|
3^11 - 2^11 = 23*331. The second prime factor is 331. These factors are
congruent to 1 mod 11.
|
|
PROGRAM
|
(PARI) apmapm1(a, b, n, d) = { c=0; forprime(x=2, n, c++; y = a^x-b^x; f=factor(y); v=component(f, 1); ln = length(v); if(ln>=d, print(v[d]", ")); ) }
|
|
CROSSREFS
|
Sequence in context: A142143 A142739 A142227 this_sequence A142375 A142304 A078949
Adjacent sequences: A089160 A089161 A089162 this_sequence A089164 A089165 A089166
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)gmail.com), Dec 06 2003
|
|
|
Search completed in 0.002 seconds
|
