A100729/30: 1-additive (Ulam-type) sequences

[hv at crypt.org]

On Nov 11, 2007 6:17 PM,  <hv at crypt.org> wrote:
> There appears to be an error in A100729: I believe A100729(3) should be 26
> rather than 25, and at least my program finds the other listed values for
> each of A100729(n) and A100730(n) for n in 2..7 (and working on n=8).

Your calculation of A100729(3) well agrees with the following comment:

%C A100729 It was proved by Akeran that a(2^k-1) = 3^(k+1) - 1.

For k=2, we have a(3)=3^3-1=26.

Max