This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A170820 Let p = n-th prime; a(n) = (p-1)/(order of (p+3)/2 mod p). 1
 2, 1, 1, 3, 1, 6, 2, 4, 1, 1, 1, 2, 2, 4, 1, 5, 2, 10, 2, 3, 1, 1, 12, 4, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 2, 2, 2, 1, 5, 2, 2, 4, 3, 42, 1, 1, 1, 1, 2, 8, 1, 1, 2, 4, 1, 1, 7, 2, 4, 6, 2, 2, 4, 30, 2, 1, 1, 1, 2, 1, 3, 2, 2, 2, 1, 25, 4, 11, 1, 10, 2, 3, 1, 1, 8, 10, 33, 1, 2, 3, 1, 6, 2, 4, 1, 2, 1, 2, 2, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 3,1 REFERENCES I. Anderson and D. A. Preece, Combinatorially fruitful properties of 3*2^(-1) and 3*2^(-2) modulo p, Discr. Math., 310 (2010), 312-324. LINKS MAPLE with(numtheory); [seq((ithprime(n)-1)/order((ithprime(n)+3)/2, ithprime(n)), n=3..130)]; CROSSREFS Cf. A014664, A001917, A170821, A170822. Sequence in context: A248008 A277606 A228267 * A003687 A104575 A318833 Adjacent sequences:  A170817 A170818 A170819 * A170821 A170822 A170823 KEYWORD nonn AUTHOR N. J. A. Sloane, Dec 24 2009 STATUS approved

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

Last modified November 15 19:54 EST 2018. Contains 317240 sequences. (Running on oeis4.)