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 A169947 #29 Oct 08 2020 04:30:43
%S A169947 1,3,8,16,29,49,82,130,205,305,450,654,947,1343,1902,2648,3675,5015,
%T A169947 6824,9166,12343,16393,21762,28682,37695,49055,63892,82610,106691,
%U A169947 136643,174862,222524,283073,357691,451538,567498,712817,890365,1112040,1382374,1717497
%N A169947 Third entry in row n of triangle in A169945.
%H A169947 Fausto A. C. Cariboni, <a href="/A169947/b169947.txt">Table of n, a(n) for n = 1..99</a> (terms 1..64 from Alois P. Heinz)
%H A169947 <a href="/index/Ca#CARRYLESS">Index entries for sequences related to carryless arithmetic</a>
%F A169947 Wanted: a recurrence. Are any of A169940-A169954 related to any other entries in the OEIS?
%F A169947 a(n) = A143823(n+1) - n - 2. - _Nathaniel Johnston_, Nov 12 2010
%t A169947 b[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], b[n - 1, sn], 0] + b[n - 1, s]]];
%t A169947 c[n_] := c[n] = b[n - 1, {n}] + If[n == 0, 0, c[n - 1]];
%t A169947 a[n_] := c[n + 1] - n - 2;
%t A169947 Table[Print[n, " ", a[n]]; a[n], {n, 1, 64}] (* _Jean-François Alcover_, Sep 02 2019, after _Alois P. Heinz_ in A143823 *)
%Y A169947 Related to thickness: A169940-A169954, A061909.
%K A169947 nonn
%O A169947 1,2
%A A169947 _N. J. A. Sloane_, Aug 01 2010
%E A169947 More terms from _R. J. Mathar_, Aug 02 2010
%E A169947 a(22)-a(28) from _Nathaniel Johnston_, Nov 12 2010
%E A169947 More terms from _Alois P. Heinz_, Sep 16 2011