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 A344385 #23 Jul 28 2024 10:07:54
%S A344385 1,2,4,6,8,12,16,24,30,32,36,48,60,72,96,128,180,192,210,240,256,360,
%T A344385 384,420,432,480,576,720,768,840,864,1152,1260,1296,1440,1800,2160,
%U A344385 2310,2520,2592,2880,3360,3456,4620,5040,5400,6144,6300,6480,6720,6912,7560
%N A344385 Numbers k of least prime signature (A025487) such that k-1 or k+1 is prime.
%C A344385 The corresponding prime numbers are A344384.
%C A344385 64 is the first number of least prime signature not in this sequence.
%C A344385 Questions: 1) Is this sequence infinite? 2) Is log(a(n)) = O(log(n)^2)? For the first 132 terms, log(a(n)) is fit unusually well by a quadratic polynomial in log(n).
%H A344385 Amiram Eldar, <a href="/A344385/b344385.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..132 from Hal M. Switkay)
%e A344385 16 is a term because 16 is in A025487 and 16 + 1 is prime.
%t A344385 (* Load the function f[n] at A025487, then: *)
%t A344385 Select[Union@ Flatten@ f[6], AnyTrue[# + {-1, 1}, PrimeQ] &]
%t A344385 (* or use the b-file at A025487: *)
%t A344385 Select[TakeWhile[Import["https://oeis.org/A025487/b025487.txt", "Data"], Length@ # == 2 &][[All, -1]], AnyTrue[# + {-1, 1}, PrimeQ] &] (* _Michael De Vlieger_, May 16 2021 *)
%Y A344385 Cf. A000040, A025487, A344384.
%K A344385 nonn
%O A344385 1,2
%A A344385 _Hal M. Switkay_, May 16 2021