login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A118335 a(n)= smallest multiple of (prime(n+1)-prime(n)) which is >= prime(n+1), where prime(m) is the m-th prime. 1
3, 6, 8, 12, 14, 20, 20, 24, 30, 32, 42, 44, 44, 48, 54, 60, 62, 72, 72, 74, 84, 84, 90, 104, 104, 104, 108, 110, 116, 140, 132, 138, 140, 150, 152, 162, 168, 168, 174, 180, 182, 200, 194, 200, 200, 216, 228, 228, 230, 236, 240, 242, 260, 258, 264, 270, 272, 282 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
a(n) < a(n-1) for n: 31,43,54,83,98,100,116,122,140,142,155,163,169,173,178,..., . - Robert G. Wilson v, Apr 27 2006
LINKS
FORMULA
a(n) - A118336(n) = 2 *(prime(n+1) - prime(n)).
a(n) - A113709(n) = prime(n+1) - prime(n), for n>= 2.
MATHEMATICA
f[n_] := Block[{m = Prime[n + 1] - Prime[n]}, k = Mod[m, Prime[n + 1]]; While[k < Prime[n + 1], k += m]; k]; Array[f, 58] (* Robert G. Wilson v, Apr 27 2006 *)
CROSSREFS
Sequence in context: A126862 A092998 A135731 * A189630 A298793 A077024
KEYWORD
nonn
AUTHOR
Leroy Quet, Apr 25 2006
EXTENSIONS
More terms from Robert G. Wilson v, Apr 27 2006
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 01:36 EDT 2024. Contains 371264 sequences. (Running on oeis4.)