Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A071556
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A071556 Smallest x > 1 such that x^prime(n) == 1 mod(prime(i)) 4<=i<=n. +0
1
8, 78, 1002, 17018, 323324, 7436430, 215656442, 6685349672, 247357937828, 10141675450908, 436092044389002, 20496326086283048, 1086305282573001492, 64092011671807087970, 3909612711980232366110, 261944051702675568529304 (list; graph; listen)
OFFSET

4,1

FORMULA

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

PROGRAM

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

CROSSREFS

Sequence in context: A000435 A052698 A052603 this_sequence A145508 A061425 A024102

Adjacent sequences: A071553 A071554 A071555 this_sequence A071557 A071558 A071559

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 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research