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 A075332 #10 Jul 08 2024 08:50:50
%S A075332 2,6,8,10,13,17,20,23,26,30,32,34,36,40,42,46,48,52,53,55,59,62,64,68,
%T A075332 70,73,76,80,81,85,87,91,93,97,98,102,107,108,111,113,115,119,121,125,
%U A075332 128,131,133,136,138,141,144,147,149,153,156,161,162,165,168,170,174
%N A075332 Differences of pairs in A075329.
%p A075332 A075332 := proc(nmax) local r,s,n,stst,rtst,i ; r := [1] : s := [] : n := {1} : while nops(r) < nmax do stst := 1 ; while stst in n or stst-op(-1,r) in n or stst+op(-1,r) in n do stst := stst +1 ; od ; s := [op(s),stst] ; n := n union {stst, stst-op(-1,r), stst+op(-1,r)} ; rtst := 1 ; while rtst in n do rtst := rtst +1 ; od ; r := [op(r),rtst] ; n := n union {rtst} ; od : for i from 1 to nops(s) do s := subsop(i=op(i,s)-op(i,r),s) ; od ; RETURN(s) ; end: A075332(100) ; # _R. J. Mathar_, Feb 03 2007
%t A075332 A075332[nmax_] := Module[{r = {1}, s = {}, n = {1}, stst, rtst}, While[Length[r] < nmax, stst = 1; While[MemberQ[n, stst] || MemberQ[n, stst - Last[r]] || MemberQ[n, stst + Last[r]], stst++]; s = Append[s, stst]; n = n~Union~{stst, stst - Last[r], stst + Last[r]}; rtst = 1; While[MemberQ[n, rtst], rtst++]; r = Append[r, rtst]; n = n~Union~{rtst}]; Return[s - Most[r]]];
%t A075332 A075332[100] (* _Jean-François Alcover_, Jul 08 2024, after _R. J. Mathar_ *)
%Y A075332 Cf. A075329, A075330, A075331.
%K A075332 nonn
%O A075332 1,1
%A A075332 _Amarnath Murthy_, Sep 18 2002
%E A075332 More terms from _R. J. Mathar_, Feb 03 2007