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 A064910 #28 Aug 26 2025 21:46:24
%S A064910 4,6,15,65,77,133,91,319,209,341,299,481,493,799,527,1007,1139,2449,
%T A064910 703,3611,989,1541,1643,3589,1537,2407,2747,2759,1829,3811,1891,4633,
%U A064910 2993,3959,2627,4033,2701,6157,3239,9073,3569,5461,4183,6439,5141,6533
%N A064910 Smallest semiprime p*q such that q >= p and q mod p = n.
%H A064910 John Cerkan, <a href="/A064910/b064910.txt">Table of n, a(n) for n = 0..10000</a>
%H A064910 John Cerkan, <a href="/A064910/a064910.py.txt">Python 2.7 program</a>
%t A064910 nsp[n_Integer] := nsp[n] = Block[{sp = n + 1}, While[PrimeOmega[sp] != 2, sp++]; sp]; a[n_Integer] := Block[{sp = 4}, While[ fi = FactorInteger@ sp; Mod[fi[[-1, 1]], fi[[1, 1]]] != n, sp = nsp[sp]]; sp]; Array[a, 46, 0] (* _Robert G. Wilson v_, Aug 20 2025 *)
%Y A064910 Cf. A001358 (p2 mod p1 = 0), A064899-A064909, A064911, A053409, A046413.
%K A064910 nonn,changed
%O A064910 0,1
%A A064910 _Patrick De Geest_, Oct 13 2001
%E A064910 Name amended by _John Cerkan_, Apr 12 2018