Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A071555
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A071555 Smallest x > 1 such that x^prime(n) == 1 mod(prime(i)) 3<=i<=n. +0
1
6, 36, 386, 5006, 85086, 1616616, 37182146, 1078282206, 33426748356, 1236789689136, 50708377254536, 2180460221945006, 102481630431415236, 5431526412865007456, 320460058359035439846, 19548063559901161830546 (list; graph; listen)
OFFSET

3,1

FORMULA

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

PROGRAM

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

CROSSREFS

Sequence in context: A053335 A108733 A137889 this_sequence A080491 A077704 A077290

Adjacent sequences: A071552 A071553 A071554 this_sequence A071556 A071557 A071558

KEYWORD

easy,nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 10 00:48 EST 2009. Contains 170565 sequences.


AT&T Labs Research