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 A109329 #12 Oct 05 2022 05:10:23
%S A109329 5,9,14,24,34,79,89,94,124,134,149,214,229,259,304,329,349,419,439,
%T A109329 454,484,494,509,584,629,654,664,679,709,719,724,734,764,789,809,824,
%U A109329 834,844,904,934,944,959,1004,1014,1084,1114,1139,1174,1184,1214,1229,1239
%N A109329 Integers with mutual residues of 4 or more.
%C A109329 This is the special case k=4 of sequences with mutual k-residues. In general, a(1) = k+1 and a(n) = min{m | m>a(n-1), mod(m,a(i))>=k, i=1,...,n-1}. k=0 gives natural numbers A000027, k=1 prime numbers A000040 and k=2 gives A109022.
%H A109329 Seppo Mustonen, <a href="http://www.survo.fi/papers/resseq.pdf">On integer sequences with mutual k-residues</a>
%H A109329 Seppo Mustonen, <a href="/A000215/a000215.pdf">On integer sequences with mutual k-residues</a> [Local copy]
%t A109329 seq[k_, n_] := Module[{a, i, j, m, f}, a = Table[0, {n}]; a[[1]] = k + 1; For[i = 2, i <= n, i++, m = a[[i - 1]] + 1; f = 1; While[f == 1, j = 1; While[j < i && Mod[m, a[[j]]] >= k, j = j + 1]; If[j == i, a[[i]] = m; f = 0, m = m + 1]]]; a];
%t A109329 seq[4, 52] (* _Jean-François Alcover_, Oct 05 2022, after Maple code in links *)
%K A109329 nonn
%O A109329 1,1
%A A109329 _Seppo Mustonen_, Aug 23 2005