Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082475
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A082475 Prime index i for prime quadruples p(i),p(i+1),p(i+2),p(i+3) that do not have a solution for the congruences p(i)^x+p(i+1)^x ~= p(i+2) mod p(i+3) and p(i+1)^x-p(i)^x ~= p(i+2) mod p(i+3). +0
2
2, 16, 20, 25, 29, 31, 33, 35, 36, 41, 45, 52, 62, 64, 79, 81, 83, 85, 88, 91, 96, 102, 103, 110, 114, 116, 117, 119, 122, 136, 154, 155, 164, 167, 172, 173, 183, 185, 188, 190, 211, 218, 219, 220, 225, 229, 231, 232, 233, 234, 238, 241, 246, 249, 252, 256, 262 (list; graph; listen)
OFFSET

1,1

EXAMPLE

For prime quadruple 3,5,7,11

3^x+5^x ~= 7 mod 11 has no solutions.

5^x-3^x ~= 7 mod 11 has no solutions.

PROGRAM

(PARI) \ solutions to prime(i+1)^x+prime(i)^x ~= prime(i+2) mod prime(i+3) or \ prime(i+1)^x-prime(i)^x ~= prime(i+2) mod prime(i+3) or noaxpmbx(m, n) = { for(p=1, m, f=0; for(x=0, n, if((prime(p+1)^x+prime(p)^x-prime(p+2))%prime(p+3)==0 || (prime(p+1)^x-prime(p)^x-prime(p+2))%prime(p+3)==0, f=1) ); if(f==0, print1(p" ")) ) }

CROSSREFS

Cf. A082371.

Adjacent sequences: A082472 A082473 A082474 this_sequence A082476 A082477 A082478

Sequence in context: A101075 A022370 A050850 this_sequence A081767 A093026 A118954

KEYWORD

easy,nonn,uned

AUTHOR

Cino Hilliard (hillcino368(AT)gmail.com), May 11 2003

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 October 11 13:47 EDT 2008. Contains 144830 sequences.


AT&T Labs Research