A272901 Smallest k>=1 such that A067128(n+k) - A067128(n) is in A067128 or a(n)=0 if there is no such k.

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2

Offset: 1

Author

Vladimir Shevelev and Peter J. C. Moses, May 09 2016

Keywords

• nonn

Comments

For n=151, the required k, if it exists, should be >9800. So one can conjecture that a(151) is the first zero term.

Crossrefs

Cf. A067128, A272879.

Programs

Maple

A272901 := proc(n)
    local k;
    for k from 1 do
        if isA067128(A067128(n+k)-A067128(n)) then
            return k;
        end if;
    end do:
end proc:
for n from 1 do
    printf("%d %d\n",n,A272901(n)) ;
end do: # R. J. Mathar, Apr 15 2024