The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A205372 Least s(k) such that n divides s(k)-s(j) for some j
 6, 6, 9, 12, 9, 12, 18, 12, 15, 26, 15, 18, 30, 18, 21, 34, 21, 30, 34, 26, 30, 26, 50, 30, 34, 30, 39, 34, 50, 34, 76, 50, 39, 60, 39, 42, 76, 42, 45, 86, 45, 60, 64, 50, 60, 50, 56, 60, 64, 56, 60, 56, 129, 60, 64, 60, 69, 64, 93, 64, 76, 134, 69, 76, 69, 72, 76 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS For a guide to related sequences, see A204892. a(n) >= n+4, with equality if and only if n+4 is in A024675. LINKS Robert Israel, Table of n, a(n) for n = 1..10000 MAPLE N:= 200: # for terms before the first > the greatest prime <= N P:= select(isprime, [seq(i, i=3..N, 2)]): S:= (P[1..-2]+P[2..-1])/2: f:= proc(n) local T, R, i;    T:= S mod n;    R:= {}:    for i from 1 to nops(T)-1 do      R:= R union {T[i]};      if member(T[i+1], R) then return S[i+1] fi;    od;    FAIL end proc: Res:= NULL: for n from 1 do   v:= f(n);   if v = FAIL then break fi;   Res:= Res, v od: Res; # Robert Israel, Sep 09 2020 MATHEMATICA (See the program at A205153.) CROSSREFS Cf. A024675, A205153, A204892. Sequence in context: A337607 A198115 A291545 * A301690 A096474 A220439 Adjacent sequences:  A205369 A205370 A205371 * A205373 A205374 A205375 KEYWORD nonn AUTHOR Clark Kimberling, Jan 26 2012 STATUS approved

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

Last modified September 18 16:24 EDT 2021. Contains 347528 sequences. (Running on oeis4.)