|
%I #19 Jan 02 2023 12:30:51
%S 0,1,2,0,1,3,4,5,2,0,1,3,4,6,7,8,5,2,0,1,3,4,6,7,9,10,11,8,5,2,0,1,3,
%T 4,6,7,9,10,12,13,14,11,8,5,2,0,1,3,4,6,7,9,10,12,13,15,16,17,14,11,8,
%U 5,2,0,1,3,4,6,7,9,10,12,13,15,16,18,19,20
%N Another fractal t(h)ree.
%C A008585(n+1) = length of row n; A062741(n+1) = sum of row n;
%C the fractal nature is illustrated by the following manipulation: remove from all rows the first two terms and also the last one, after subtracting all terms by 3, the original t(h)ree will reappear.
%H Reinhard Zumkeller, <a href="/A253672/b253672.txt">Rows n = 0..100 of triangle, flattened</a>
%H Éric Angelini, <a href="http://list.seqfan.eu/oldermail/seqfan/2015-January/014268.html">More (and more) fractal trees - and erasures</a>, SeqFan list, Jan 08 2015.
%F T(n,0) = 0; T(n,1)=1; T(n,2*n-1) = 2; T(n+1,k+2) = T(n,k)+3, k = 0..3*n-1.
%e . 0: | 0 1 2|
%e . 1: 0 1 | 3 4 5| 2
%e . 2: 0 1 3 4 | 6 7 8| 5 2
%e . 3: 0 1 3 4 6 7 | 9 10 11| 8 5 2
%e . 4: 0 1 3 4 6 7 9 10 |12 13 14| 11 8 5 2
%e . 5: 0 1 3 4 6 7 9 10 12 13 |15 16 17| 14 11 8 5 2
%e . 6: 0 1 3 4 6 7 9 10 12 13 15 16 |18 19 20| 17 14 11 8 5 2
%e . 7: 0 1 3 4 6 7 9 10 12 13 15 16 18 19 |21 22 23| 20 17 14 11 8 5 2 .
%o (Haskell)
%o a253672 n k = a253672_tabf !! n !! k
%o a253672_row n = a253672_tabf !! n
%o a253672_tabf = [0,1,2] : f [] [0,1,2] [] (iterate (map (+ 3)) [3..5]) where
%o f as bs cs (uvws:uvwss) = (as' ++ uvws ++ cs') : f as' uvws cs' uvwss
%o where as' = as ++ [u,v]; cs' = [w] ++ cs
%o [u,v,w] = bs
%o a253672_list = concat a253672_tabf
%Y Cf. A008585, A062741.
%K nonn,tabf
%O 0,3
%A _Eric Angelini_ and _Reinhard Zumkeller_, Jan 08 2015
|
