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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A073604 Smallest multiple of (n+1)-st prime which is == 1 mod n-th prime. 0
3, 10, 21, 22, 78, 170, 171, 115, 116, 465, 962, 1148, 903, 517, 424, 531, 1830, 3417, 1207, 2628, 4819, 1660, 1246, 7566, 7373, 5253, 2782, 5886, 9266, 13335, 4192, 3014, 9591, 2086, 11325, 19782, 21353, 6847, 4844, 5191, 16290, 31133, 18528 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

EXAMPLE

a(5) = 78 which is 6*13 and 78 ==1 (mod 11)

MATHEMATICA

f[n_] := Block[{k = 1, p = Prime[n], q = Prime[n + 1]}, While[ Mod[k*q, p] != 1, k++ ]; k*q]; Table[f[n], {n, 1, 45}]

CROSSREFS

Sequence in context: A081205 A092305 A196166 * A004194 A097590 A194141

Adjacent sequences:  A073601 A073602 A073603 * A073605 A073606 A073607

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Aug 04 2002

EXTENSIONS

Edited by Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 05 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 17 13:28 EST 2012. Contains 206031 sequences.