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!)
 A343070 a(1) = 1, for n > 1, a(n) is the smallest positive integer for which a(n-1) + n + a(n) is a prime. 0
 1, 2, 2, 1, 1, 4, 2, 1, 1, 2, 4, 1, 3, 2, 2, 1, 1, 4, 6, 3, 5, 2, 4, 1, 3, 2, 2, 1, 1, 6, 4, 1, 3, 4, 2, 3, 1, 2, 2, 1, 1, 4, 6, 3, 5, 2, 4, 1, 3, 6, 2, 5, 1, 4, 2, 1, 1, 2, 6, 1, 5, 4, 4, 3, 3, 2, 2, 1, 1, 2, 6, 1, 5, 4, 4, 3, 3, 2, 2, 1, 1, 6, 8 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Todor Szimeonov, A completive sequence MATHEMATICA a[1] = 1; a[n_] := a[n] = NextPrime[a[n - 1] + n] - a[n - 1] - n; Array[a, 100] (* Amiram Eldar, Apr 04 2021 *) PROG (Python) from sympy import nextprime def aupton(terms):   alst = [1]   for n in range(2, terms+1):     alst.append(nextprime(alst[-1] + n) - alst[-1] - n)   return alst print(aupton(87)) # Michael S. Branicky, Apr 04 2021 CROSSREFS Cf. A343039. Sequence in context: A100996 A232504 A292201 * A090048 A064285 A006694 Adjacent sequences:  A343067 A343068 A343069 * A343071 A343072 A343073 KEYWORD nonn AUTHOR Todor Szimeonov, Apr 04 2021 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 July 30 12:39 EDT 2021. Contains 346359 sequences. (Running on oeis4.)