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 A114013 #8 Jan 29 2023 09:43:55
%S A114013 49,99,39,119,19,69,29,279,259,369,129,329,159,59,549,469,639,219,79,
%T A114013 249,89,679,909,309,749,109,339,889,1179,959,139,149,1359,1099,489,
%U A114013 1169,519,179,1629,1719,579,1379,199,1899,669,1589,229,699,239,2169,2259
%N A114013 Least multiple of prime(n) ending in digit 9.
%C A114013 Subsidiary sequences: (1) least multiple of prime(n) ending in 2 or 3 or ..., or 8; (2) divide the above sequences by prime(n).
%t A114013 f[n_] := Block[{k = 1, p = Prime[n]}, While[Mod[k*p, 10] != 9, k++ ]; k*p]; Table[ f[n], {n, 4, 54}] (* _Robert G. Wilson v_, Nov 17 2005 *)
%o A114013 (PARI) a(n) = my(p=prime(n), k=1); while(((k*p) % 10) != 9, k++); k*p; \\ _Michel Marcus_, Jan 29 2023
%Y A114013 Cf. A114011, A114012.
%K A114013 base,nonn
%O A114013 4,1
%A A114013 _Amarnath Murthy_, Nov 12 2005
%E A114013 More terms from _Robert G. Wilson v_, Nov 17 2005