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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A099794 a(n) = smallest integer k such that k*prime(n) == 1 mod j for each integer j with 1<j<prime(n). 3
1, 1, 5, 43, 2291, 6397, 423953, 2579419, 30364247, 77544004469, 1277242663471, 70250377083373, 3909462041753561, 101888460343995907, 8217087542785091183, 2455846588270412484317, 38974424104246263663539 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

FORMULA

a(n) = A094998(n) / prime(n).

CROSSREFS

Cf. A094998, A099795, A099796.

Sequence in context: A160450 A114604 A085098 * A142726 A079646 A098891

Adjacent sequences:  A099791 A099792 A099793 * A099795 A099796 A099797

KEYWORD

nonn

AUTHOR

Ray Chandler (rayjchandler(AT)sbcglobal.net), Oct 29 2004

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 17:27 EST 2012. Contains 205644 sequences.