The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A338283 Lexicographically earliest sequence of positive integers such that for any distinct m and n, Sum_{k = m+1-a(m)..m} a(k) <> Sum_{k = n+1-a(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+1-a(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
See A336346 and A338292 for similar sequences.
Cf. A338285 (corresponding sums).
Sequence in context: A182744 A308355 A336346 * A104324 A193212 A131818
KEYWORD
nonn
AUTHOR
Rémy Sigrist, Oct 20 2020
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 13 23:50 EDT 2024. Contains 373391 sequences. (Running on oeis4.)