The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A256572 Number of triples (x,x+1,x+2) with 1 < x <= p-3 of consecutive integers less than p whose product is 1 modulo p, where p = prime(n). 3
 0, 0, 0, 1, 1, 0, 1, 1, 2, 0, 0, 1, 0, 1, 0, 1, 3, 1, 1, 0, 0, 1, 1, 1, 1, 3, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 3, 3, 0, 1, 1, 0, 0, 1, 3, 3, 1, 1, 0, 0, 1, 1, 0, 1, 0, 3, 0, 1, 1, 1, 3, 0, 1, 3, 0, 1, 3, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 3, 1, 0, 3, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 3, 3, 0, 3, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 3, 1, 1, 3, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 3, 0, 3, 0, 1, 3, 1, 3, 0, 0, 0, 3, 1, 3, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 3, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,9 COMMENTS Is 23 the only prime with two triples? LINKS Marian Kraus, Table of n, a(n) for n = 1..9592 FORMULA |T| where T={x|x*(x+1)*(x+2)==1 (mod p), p is prime, 1

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 September 28 04:24 EDT 2021. Contains 347698 sequences. (Running on oeis4.)