This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A379014 #19 Dec 23 2024 01:55:18
%S A379014 1,2,4,3,8,3,5,3,6,5,1,5,5,6,6,5,14,5,15,10,5,11,26,4,2,2,3,3,4,4,17,
%T A379014 10,18,11,18,10,34,27,19,19,19,10,19,20,21,11,20,7,19,20,21,21,111,8,
%U A379014 21,7,21,8,65,8,23,7,20,21,68,6,20,2,19,20,1,21,20,20
%N A379014 Least number k such that prime(n) + prime(k) is a multiple of n, or -1 if no such number exists.
%C A379014 Indices n where a(n)=1 correspond with terms of A092044. - _Bill McEachen_, Dec 21 2024
%F A379014 a(n) = A000720(A294639(n)). - _Pontus von Brömssen_, Dec 13 2024
%t A379014 a[n_]:=Module[{k=1},While[!Divisible[Prime[n]+Prime[k],n], k++]; k]; Array[a,74] (* _Stefano Spezia_, Dec 13 2024 *)
%o A379014 (PARI) a(n) = my(k=1, p=prime(n)); while ((p+prime(k)) % n, k++); k; \\ _Michel Marcus_, Dec 13 2024
%Y A379014 Cf. A000040, A000720, A068901, A294639.
%K A379014 nonn
%O A379014 1,2
%A A379014 _Jean-Marc Rebert_, Dec 13 2024