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 A064885 #25 May 15 2022 12:32:36
%S A064885 3,2,3,5,2,3,8,5,7,2,3,11,8,13,5,12,7,9,2,3,14,11,19,8,21,13,18,5,17,
%T A064885 12,19,7,16,9,11,2,3,17,14,25,11,30,19,27,8,29,21,34,13,31,18,23,5,22,
%U A064885 17,29,12,31,19,26,7,23,16
%N A064885 Eisenstein array Ei(3,2).
%C A064885 In Eisenstein's notation this is the array for m=3 and n=2; see pp. 41-2 of the Eisenstein reference given for A064881. The array for m=n=1 is A049456.
%C A064885 For n >= 1, the number of entries of row is 2^(n-1)+1 with the difference sequence [2,1,2,4,8,16,...]. Row sums give 5*A007051(n-1).
%C A064885 The binary tree built from the rationals a(n,m)/a(n,m+1), m=0..2^(n-1), for each row n >= 1 gives the subtree of the (Eisenstein-)Stern-Brocot tree in the version of, e.g., Calkin and Wilf (for the reference see A002487, also for the Wilf link) with root 3/2. The composition rule of this tree is i/j -> i/(i+j), (i+j)/j.
%H A064885 <a href="/index/St#Stern">Index entries for sequences related to Stern's sequences</a>
%F A064885 a(n, m) = a(n-1, m/2) if m is even, else a(n, m) = a(n-1, (m-1)/2) + a(n-1, (m+1)/2), a(1, 0) = 3, a(1, 1) = 2.
%e A064885 Triangle begins:
%e A064885 {3, 2};
%e A064885 {3, 5, 2};
%e A064885 {3, 8, 5, 7, 2};
%e A064885 {3, 11, 8, 13, 5, 12, 7, 9, 2};
%e A064885 ...
%e A064885 This binary subtree of rationals is built from 3/2; 3/5, 5/2; 3/8, 8/5, 5/7, 7/2; ...
%t A064885 nmax = 6; a[n_, m_?EvenQ] := a[n - 1, m/2]; a[n_, m_?OddQ] := a[n, m] = a[n - 1, (m - 1)/2] + a[n - 1, (m + 1)/2]; a[1, 0] = 3; a[1, 1] = 2; Flatten[Table[a[n, m], {n, 1, nmax}, {m, 0, 2^(n - 1)}]] (* _Jean-François Alcover_, Sep 28 2011 *)
%Y A064885 Cf. A002487, A007051, A049456, A064881.
%K A064885 nonn,easy,tabf
%O A064885 1,1
%A A064885 _Wolfdieter Lang_, Oct 19 2001