Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A123571
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A123571 Smallest prime p such that p divides m^(m+1)+1, where m = (p-2n-1)/(2n). +0
1
13, 29, 79, 41, 41, 313, 421, 257, 541, 461, 1013, 673, 2341, 197, 661, 2113, 1361, 1009, 4447, 15161, 2857, 7789, 7499, 2113, 5101, 8269, 811, 9689, 1567, 1381, 2543, 31489, 3631, 23189, 9941, 10513, 16651, 21661, 84163, 5281, 13613, 1933, 22447 (list; graph; listen)
OFFSET

1,1

COMMENT

Corresponding m = {5,6,12,4,3,25,29,15,29,22,45,27,89,6,21,...}.

EXAMPLE

a(1) = 13 because for m = (13-3)/2 = 5 prime 13 divides m^(m+1)+1 = 5^6+1 = 15626, but m^(m+1)+1 is not divisible by any prime p of the form p=2m+3 for m<5.

CROSSREFS

Sequence in context: A075636 A139838 A141196 this_sequence A120273 A104817 A048450

Adjacent sequences: A123568 A123569 A123570 this_sequence A123572 A123573 A123574

KEYWORD

nonn

AUTHOR

Alexander Adamchuk (alex(AT)kolmogorov.com), Nov 12 2006

EXTENSIONS

More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 17 2008

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 July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research