|
%I #16 Apr 24 2024 11:11:31
%S 1,1,2,1,1,2,1,1,3,1,2,2,2,1,1,1,3,2,1,1,1,1,3,2,3,4,1,1,2,1,3,1,1,2,
%T 2,2,1,1,1,4,2,3,2,1,1,1,1,4,2,1,1,1,3,1,1,4,2,2,1,1,2,1,3,1,2,5,1,1,
%U 3,2,3,1,4,1,2,2,3,1,1,1,1,1,2,3,1,1,1,5,2,1,1,3,2,1,4,2,2,1,1,1,2,1,1,5,1
%N Column of Zorach additive triangle in which n appears (or 0 in the unlikely event that it does not).
%H Reinhard Zumkeller, <a href="/A072038/b072038.txt">Table of n, a(n) for n = 1..1000</a>
%H A. C. Zorach, <a href="http://www.cazort.net/static/triangle.php">Additive triangle</a>
%H <a href="/A035312/a035312_2.hs.txt">Haskell programs for sequences in connection with Zorach additive triangle</a>
%F If a(n) > 0: n = A035312(A072039(n)-1, a(n)-1).
%e a(8)=1 since 8 appears in the first (i.e. left hand) column.
%o (Haskell) -- See link.
%Y If a(n)=1 then n is in A035311, if a(n)=A072039(n) then n is in A035313. Cf. A035312, A035358, A072039.
%K nonn
%O 1,3
%A _Henry Bottomley_, Jun 07 2002
|
