Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A161749
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A161749 Smallest distinct primes, if they exist, in x^n - y^(n-2). +0
1
3, 2, 7, 5, 127, 3299, 1967249047, 8191, 30450469261 (list; graph; listen)
OFFSET

1,1

COMMENT

For even n > 4 = 2m, x^2m - y^(2m-2) = (x^m)^2 - y^((m-1))^2 is divisible by

x^m - y^(m-1) which is not prime. This accounts for the phrase "if they exist"

in the definition.

PROGRAM

(PARI) diffpowers(n, m) =

{

local(a, c=0, c2=0, j, k, y);

a=vector(floor(n^2/log(n^2)));

for(j=1, n,

for(k=1, n,

y=j^m-k^(m-1);

if(ispseudoprime(y),

c++;

\\ print(j", "k", "y);

a[c]=y;

);

);

);

a=vecsort(a);

for(j=2, length(a),

if(a[j]!=a[j-1]&&a[j]!=0,

c2++;

print1(a[j]", ");

if(c2>100, break);

);

);

}

CROSSREFS

Sequence in context: A155046 A033318 A093780 this_sequence A101307 A096899 A154448

Adjacent sequences: A161746 A161747 A161748 this_sequence A161750 A161751 A161752

KEYWORD

nonn,uned

AUTHOR

Cino Hilliard (hillcino368(AT)hotmail.com), Jun 17 2009

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research