Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A071554
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A071554 Smallest x > 1 such that x^prime(n) == 1 mod(prime(i)) 2<=i<=n. +0
1
4, 16, 106, 1156, 15016, 255256, 4849846, 111546436, 3234846616, 100280245066, 3710369067406, 152125131763606, 6541380665835016, 307444891294245706, 16294579238595022366, 961380175077106319536, 58644190679703485491636 (list; graph; listen)
OFFSET

2,1

FORMULA

a(n)=(1/2)*(A006862(n)+1)

CROSSREFS

Sequence in context: A136793 A009630 A131043 this_sequence A087335 A094356 A061129

Adjacent sequences: A071551 A071552 A071553 this_sequence A071555 A071556 A071557

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 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research