|
%I #15 Apr 28 2016 12:40:48
%S 0,1,1,3,2,4,8,3,5,7,9,11,21,5,7,11,13,17,19,23,25,29,55,8,10,12,16,
%T 18,22,24,26,30,32,34,36,44,46,50,60,64,66,76,144,13,17,19,23,25,29,
%U 31,35,37,41,43,47,49,53,55,61,65,67,71,73,77,79,83,89,95
%N Table of distinct terms in rows of triangle A230871, in natural order.
%C A230872 gives the union of all rows;
%C A231335(n) = number of Fibonacci numbers in row n.
%H Reinhard Zumkeller, <a href="/A231330/b231330.txt">Rows n = 0..14 of triangle, flattened</a>
%e Initial rows:
%e . 0: 0;
%e . 1: 1;
%e . 2: 1,3;
%e . 3: 2,4,8 from a230871(3,*) = [2,2,4,8];
%e . 4: 3,5,7,9,11,21 from a230871(4,*) = [3,5,3,5,7,9,11,21];
%e . 5: 5,7,11,13,17,19,23,25,29,55;
%e . 6: 8,10,12,16,18,22,24,26,30,32,34,36,44,46,50,60,64,66,76,144.
%o (Haskell)
%o import Data.List (sort, nub)
%o a231330 n k = a231330_tabf !! n !! k
%o a231330_row n = a231330_tabf !! n
%o a231330_tabf = map (sort . nub) a230871_tabf
%Y Cf. A231331 (row lengths), A000045 (left edge), A001906 (right edge).
%K nonn,look,tabf
%O 0,4
%A _Reinhard Zumkeller_, Nov 07 2013
|
