

A338283


Lexicographically earliest sequence of positive integers such that for any distinct m and n, Sum_{k = m+1a(m)..m} a(k) <> Sum_{k = n+1a(n)..n} a(k).


4



1, 2, 2, 3, 2, 3, 4, 2, 3, 4, 3, 4, 4, 3, 5, 4, 5, 4, 4, 5, 5, 6, 4, 5, 6, 5, 6, 5, 6, 6, 5, 7, 6, 6, 7, 6, 5, 7, 8, 4, 8, 6, 6, 7, 8, 6, 7, 7, 8, 6, 7, 8, 7, 8, 8, 8, 6, 9, 7, 8, 8, 9, 8, 7, 8, 9, 8, 9, 8, 9, 10, 8, 9, 9, 8, 10, 9, 9, 10, 8, 10, 9, 10, 9, 9
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

In other words, for any n > 0, the sum of the a(n) terms up to and including a(n) is always unique.
This sequence is unbounded.


LINKS



EXAMPLE

The first terms, alongside the corresponding sums, are:
n a(n) a(n+1a(n))+...+a(n)
  
1 1 1
2 2 3
3 2 4
4 3 7
5 2 5
6 3 8
7 4 12
8 2 6
9 3 9
10 4 13


PROG

(PARI) See Links section.


CROSSREFS



KEYWORD

nonn


AUTHOR



STATUS

approved



