|
%I #18 Oct 12 2017 01:46:36
%S 1,0,1,1,0,1,2,1,1,0,1,3,2,3,1,2,1,1,0,1,4,3,5,2,5,3,4,1,3,2,3,1,2,1,
%T 1,0,1,5,4,7,3,8,5,7,2,7,5,8,3,7,4,5,1,4,3,5,2,5,3,4,1,3,2,3,1,2,1,1,
%U 0,1,6,5,9,4,11,7,10,3,11,8,13,5,12,7,9,2,9,7,12,5,13,8,11,3,10,7,11,4,9,5
%N Stern's diatomic array read by rows (version 2).
%C Row n has length 2^n + 1.
%H Harvey P. Dale, <a href="/A070878/b070878.txt">Table of n, a(n) for n = 0..10000</a>
%H C. Giuli and R. Giuli, <a href="http://www.fq.math.ca/Scanned/17-2/giuli.pdf">A primer on Stern's diatomic sequence</a>, Fib. Quart., 17 (1979), 103-108, 246-248 and 318-320 (but beware errors).
%H <a href="/index/St#Stern">Index entries for sequences related to Stern's sequences</a>
%F Each row is obtained by copying the previous row but interpolating the sums of pairs of adjacent terms. E.g. after 1 2 1 1 0 we get 1 1+2 2 2+1 1 1+1 1 1+0 0.
%e Triangle begins:
%e 1,0;
%e 1,1,0;
%e 1,2,1,1,0;
%e 1,3,2,3,1,2,1,1,0;
%e ...
%t row[1] = {1, 0}; row[n_] := row[n] = (r = row[n-1]; Riffle[r, Most[r + RotateLeft[r]]]); Flatten[ Table[row[n], {n, 1, 7}]] (* _Jean-François Alcover_, Nov 03 2011 *)
%t Flatten[NestList[Riffle[#,Total/@Partition[#,2,1]]&,{1,0},6]] (* _Harvey P. Dale_, Dec 06 2014 *)
%Y Cf. A049456, A070879, A049455.
%Y Rows sums are A007051. See A293160 for number of distinct terms in each row.
%K nonn,tabf,nice,easy
%O 0,7
%A _N. J. A. Sloane_, May 20 2002
%E More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 07 2003
|
