login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A071556 Smallest x > 1 such that x^prime(n) == 1 mod(prime(i)) 4<=i<=n. 0

%I

%S 8,78,1002,17018,323324,7436430,215656442,6685349672,247357937828,

%T 10141675450908,436092044389002,20496326086283048,1086305282573001492,

%U 64092011671807087970,3909612711980232366110,261944051702675568529304

%N Smallest x > 1 such that x^prime(n) == 1 mod(prime(i)) 4<=i<=n.

%F a(n)=1+A002110(n)/30

%o (PARI) for(n=3,20,print1((prod(i=1,n, prime(i))+30)/30,","))

%K easy,nonn

%O 4,1

%A _Benoit Cloitre_, May 30 2002

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 23 18:54 EST 2019. Contains 320438 sequences. (Running on oeis4.)