This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A001390 Smallest multiplicative generator for quadratic residues mod prime(n). 2

%I

%S 1,1,4,2,3,4,2,4,2,4,7,3,2,9,2,4,3,4,4,2,6,2,3,5,2,4,2,3,12,9,9,3,2,4,

%T 4,5,3,4,2,4,3,4,2,2,4,2,4,9,3,5,7,2,3,3,9,2,4,2,7,5,6,4,7,2,2,4,5,3,

%U 3,3,9,2,2,3,4,2,4,3,2,2,3,4,5,6,5,3,2,3,4,2,3,2,2,4,5,2,4,2,4,4,4,4,3,2,5,17

%N Smallest multiplicative generator for quadratic residues mod prime(n).

%H Robert Israel, <a href="/A001390/b001390.txt">Table of n, a(n) for n = 1..10000</a>

%p f:= proc(p) local x;

%p for x from 1 do if numtheory:-order(x,p) = (p-1)/2 then return x fi od

%p end proc:

%p f(2):= 1:

%p seq(f(ithprime(n)), n=1..1000); # _Robert Israel_, Jan 14 2016

%Y Cf. A000040.

%K nonn

%O 1,3

%A _N. J. A. Sloane_.

%E More terms from _David W. Wilson_ Aug 15 1996.

%E Offset changed by _Robert Israel_, Jan 14 2016

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 26 02:35 EDT 2019. Contains 323579 sequences. (Running on oeis4.)