cp's OEIS Frontend

A283682 Unique sequence with a(1)=0, a(2)=1, representing an array T(i,j) read by antidiagonals in which T(i,j) = a(i) + a(j).

%I A283682 #6 Mar 16 2017 22:54:03
%S A283682 0,1,1,1,2,1,1,2,2,1,2,2,2,2,2,1,3,2,2,3,1,1,2,3,2,3,2,1,2,2,2,3,3,2,
%T A283682 2,2,2,3,2,2,4,2,2,3,2,1,3,3,2,3,3,2,3,3,1,2,2,3,3,3,2,3,3,3,2,2,2,3,
%U A283682 2,3,4,2,2,4,3,2,3,2,2,3,3,2,4,3,2,3,4,2,3,3
%N A283682 Unique sequence with a(1)=0, a(2)=1, representing an array T(i,j) read by antidiagonals in which T(i,j) = a(i) + a(j).
%C A283682 Any positive integer appears infinitely many times.
%H A283682 Ivan Neretin, <a href="/A283682/b283682.txt">Table of n, a(n) for n = 1..26796</a>
%e A283682 The sequence begins: 0, 1, 1, 1, 2, 1, 1, 2, 2, 1, ...
%e A283682 It represents a rectangular array read by downward antidiagonals. The first row of the array is this sequence itself; so is the first column. Every term in the array is the sum of the initial terms of its row and column:
%e A283682 0 1 1 1 2 1...
%e A283682 1 2 2 2 3...
%e A283682 1 2 2 2...
%e A283682 1 2 2...
%e A283682 2 3...
%e A283682 1...
%e A283682 ...
%t A283682 Nest[Flatten@Table[#[[n - i]] + #[[i]], {n, Length[#] + 1}, {i, n - 1}] &, {0, 1}, 4]
%Y A283682 Cf. A283681, A283683.
%K A283682 nonn,tabl
%O A283682 1,5
%A A283682 _Ivan Neretin_, Mar 14 2017