A072038 Column of Zorach additive triangle in which n appears (or 0 in the unlikely event that it does not).

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, 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, 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

Offset: 1

Author

Henry Bottomley, Jun 07 2002

Keywords

• nonn

Examples

			a(8)=1 since 8 appears in the first (i.e. left hand) column.
		

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 1..1000
• A. C. Zorach, Additive triangle
• Haskell programs for sequences in connection with Zorach additive triangle

Crossrefs

If a(n)=1 then n is in A035311, if a(n)=A072039(n) then n is in A035313. Cf. A035312, A035358, A072039.

Programs

Haskell

-- See link.

Formula

If a(n) > 0: n = A035312(A072039(n)-1, a(n)-1).