Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A088192
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A088192 Distance between the primes and the largest quadratic residues modulo the primes. +0
8
1, 2, 1, 3, 2, 1, 1, 2, 5, 1, 3, 1, 1, 2, 5, 1, 2, 1, 2, 7, 1, 3, 2, 1, 1, 1, 3, 2, 1, 1, 3, 2, 1, 2, 1, 3, 1, 2, 5, 1, 2, 1, 7, 1, 1, 3, 2, 3, 2, 1, 1, 7, 1, 2, 1, 5, 1, 3, 1, 1, 2, 1, 2, 11, 1, 1, 2, 1, 2, 1, 1, 7, 3, 1, 2, 5, 1, 1, 1, 1, 2, 1, 7, 1, 3, 2, 1, 1, 1, 3, 2, 13, 3, 2, 2, 5, 1, 1, 2, 1 (list; graph; listen)
OFFSET

1,2

COMMENT

The values are 1 or a prime number (easily provable!). The maximum occurring prime values increase very slowly: up to 10^5 terms the largest prime is 43. The primes do not appear in order.

LINKS

Ferenc Adorjan, The sequence of largest quadratic residues modulo the primes.

PROGRAM

(PARI) qrp_pm(fr, to)= {/* The distance of largest QR modulo the primes from the primes */ local(m, p, v=[]); for(i=fr, to, m=1; p=prime(i); j=2; while((j<=(p-1)/2)&&(m<p-1), m=max(m, (j^2)%p); j++); v=concat(v, p-m)); print(v) }

CROSSREFS

Cf. A088190, A088191, A088193, A088194, A088195.

Sequence in context: A020779 A114890 A023512 this_sequence A056062 A064034 A065120

Adjacent sequences: A088189 A088190 A088191 this_sequence A088193 A088194 A088195

KEYWORD

easy,nonn

AUTHOR

Ferenc Adorjan (fadorjan(AT)freemail.hu), Sep 22 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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research