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 A106252 #20 Mar 21 2017 10:34:04
%S A106252 1,3,5,7,8,11,12,14,16,18,19,22,23,25,27,29,30,33,34,36,38,40,41,44,
%T A106252 45,47,49,51,52,55,56,58,60,62,63,66,67,69,71,73,74,77,78,80,82,84,85,
%U A106252 88,89,91,93,95,96,99,100,102,104,106,107,110,111,113,115,117,118,121,122
%N A106252 Number of positive integer triples (x,y,z), with x<=y<=z<=n, such that each of x,y and z divides the sum of the other two.
%C A106252 The following conjecture is probably not very difficult: Conjecture. The sequence (A106253) of differences of this sequence is periodic with period 6.
%C A106252 That the difference sequence in the above conjecture is periodic follows from a formula in the Formula and Mathematica sections; see A211701 for a discussion. [_Clark Kimberling_, Apr 20 2012]
%H A106252 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (0, 1, 1, 0, -1).
%F A106252 a(n) = n + floor(n/2) + floor(n/3). [_Clark Kimberling_, Apr 20 2012]
%e A106252 (1,1,1), (1,1,2), (1,2,3), (2,2,2) and (3,3,3) are the triples that have the desired property for n=3, so a(3)=5.
%t A106252 f[n_, m_] := Sum[Floor[n/k], {k, 1, m}]; t = Table[f[n, 3], {n, 1, 90}] (* _Clark Kimberling_, Apr 20 2012 *)
%t A106252 LinearRecurrence[{0,1,1,0,-1},{1,3,5,7,8},67] (* _Ray Chandler_, Aug 01 2015 *)
%Y A106252 Cf. A106253.
%K A106252 nonn,easy
%O A106252 1,2
%A A106252 _John W. Layman_, Apr 27 2005