OFFSET
1,3
COMMENTS
Indices of ones are given by A005282.
Conjecture: For all positive i, j, k there exists some n such that a(n) = a(n + j) = a(n + k) = i.
Also, if a(k)=a(j) for any k<j, j-k is a unique result for the value of a(k). - Marc Morgenegg, May 31 2024
LINKS
Peter Kagey, Table of n, a(n) for n = 1..10000
EXAMPLE
For n=1 through n=7, the terms are as follows:
a(1) = 1;
a(2) = 1;
a(3) != 1 because a(1) = a(1+1) = a(1+1) so a(1+1+1) != a(1);
a(3) = 2, the least value such that satisfies the sequence condition;
a(4) = 1;
a(5) != 1 because a(1) = a(1+1) = a(1+3) so a(1+1+3) != a(1);
a(5) = 2, the least value such that satisfies the sequence condition;
a(6) != 1 because a(2) = a(2+2) = a(2+2) so a(2+2+2) != a(2);
a(6) = 2, the least value such that satisfies the sequence condition;
a(7) != 1 because a(1) = a(1+3) = a(1+3) so a(1+3+3) != a(1);
a(7) != 2 because a(3) = a(3+2) = a(3+2) so a(3+2+2) != a(3);
a(7) = 3, the least value such that satisfies the sequence condition.
CROSSREFS
KEYWORD
nonn,look
AUTHOR
Peter Kagey, Apr 13 2017
STATUS
approved