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 A169948 #14 Aug 27 2019 09:50:29
%S A169948 1,2,6,14,29,52,96,160,277,450,712,1086,1657,2448,3636,5280,7635,
%T A169948 10840,15392,21372,29655,40580,55282,74620,100651,134232,178922,
%U A169948 236488,312019,408550,534288,692978,897931,1156256,1485650,1897704,2421635,3071608,3894042
%N A169948 Fourth entry in row n of triangle in A169945.
%C A169948 Wanted: a recurrence. Are any of A169940-A169954 related to any other entries in the OEIS?
%H A169948 <a href="/index/Ca#CARRYLESS">Index entries for sequences related to carryless arithmetic</a>
%F A169948 a(n) = A196723(n+1) - A143823(n+1). - _Andrew Howroyd_, Jul 09 2017
%t A169948 b[n_, s_] := b[n, s] = Module[{sn, m}, m = Length[s]; sn = Append[s, n]; If[n < 1, 1, b[n - 1, s] + If[m*(m + 1)/2 == Length[Union[Flatten[Table[ sn[[i]] + sn[[j]], {i, 1, m}, {j, i + 1, m + 1}]]]], b[n - 1, sn], 0]]];
%t A169948 A196723[n_] := A196723[n] = b[n - 1, {n}] + If[n == 0, 0, A196723[n - 1]];
%t A169948 c[n_, s_] := c[n, s] = Module[{sn, m}, If[n < 1, 1, sn = Append[s, n]; m = Length[sn]; If[m*(m - 1)/2 == Length[Table[sn[[i]] - sn[[j]], {i, 1, m - 1}, {j, i + 1, m}] // Flatten // Union], c[n - 1, sn], 0] + c[n-1, s]]];
%t A169948 A143823[n_] := A143823[n] = c[n - 1, {n}] + If[n == 0, 0, A143823[n - 1]];
%t A169948 a[n_] := a[n] = A196723[n + 1] - A143823[n + 1];
%t A169948 Table[Print[n, " ", a[n]]; a[n], {n, 2, 40}] (* _Jean-François Alcover_, Aug 27 2019, after _Alois P. Heinz_ in A196723 and A143823 *)
%Y A169948 Related to thickness: A169940-A169954, A061909.
%Y A169948 Cf. A143823, A196723.
%K A169948 nonn
%O A169948 2,2
%A A169948 _N. J. A. Sloane_, Aug 01 2010
%E A169948 a(15)-a(28) from _Nathaniel Johnston_, Nov 12 2010
%E A169948 a(29)-a(40) from _Andrew Howroyd_, Jul 09 2017