cp's OEIS Frontend

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.

A385660 Numbers k such that prime(k+1)-prime(k) divides k.

This page as a plain text file.
%I A385660 #42 Jul 14 2025 22:18:47
%S A385660 1,2,4,8,10,12,18,20,24,26,28,36,44,48,52,54,60,64,72,80,84,88,96,98,
%T A385660 102,104,108,112,116,120,128,136,140,142,144,148,152,168,174,176,178,
%U A385660 180,182,190,192,206,210,212,216,224,230,234,236,240,244,248,252,256,262,264,268,276,286,288,294
%N A385660 Numbers k such that prime(k+1)-prime(k) divides k.
%H A385660 Vighnesh Patil, <a href="/A385660/b385660.txt">Table of n, a(n) for n = 1..1000</a>
%e A385660 k = 18 is a term since prime(19) - prime(18) = 6 divides 18.
%t A385660 q[k_] := Divisible[k, Prime[k + 1] - Prime[k]]; Select[Range[300], q] (* _Amiram Eldar_, Jul 09 2025 *)
%o A385660 (Python)
%o A385660 from sympy import prime
%o A385660 def ok(k): return k % (prime(k+1) - prime(k)) == 0
%o A385660 print([k for k in range(1, 300) if ok(k)])
%Y A385660 Cf. A000040, A001223, A029707.
%K A385660 nonn,easy
%O A385660 1,2
%A A385660 _Vighnesh Patil_, Jul 06 2025