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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A071555 Smallest x > 1 such that x^prime(n) == 1 mod(prime(i)) 3<=i<=n. 0
6, 36, 386, 5006, 85086, 1616616, 37182146, 1078282206, 33426748356, 1236789689136, 50708377254536, 2180460221945006, 102481630431415236, 5431526412865007456, 320460058359035439846, 19548063559901161830546 (list; graph; refs; listen; history; internal format)
OFFSET

3,1

FORMULA

a(n)=1+A002110(n)/6

PROG

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

CROSSREFS

Sequence in context: A053335 A108733 A137889 * A080491 A077704 A185085

Adjacent sequences:  A071552 A071553 A071554 * A071556 A071557 A071558

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), May 30 2002

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

Content is available under The OEIS End-User License Agreement .

Last modified February 14 01:35 EST 2012. Contains 205567 sequences.