OFFSET
1,3
COMMENTS
In other words, we start with the natural numbers and repeatedly replace the leftmost pair of consecutive terms with minimal sum by its sum; a(n) corresponds to the position of the pair substituted at n-th step.
LINKS
Rémy Sigrist, Table of n, a(n) for n = 1..10000
Rémy Sigrist, PARI program for A338764
EXAMPLE
The first terms, alongside L_n, are:
n a(n) L_n
-- ---- ----------------------------------------------------------
1 1 { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, ... }
2 1 { 3, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, ... }
3 2 { 6, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, ... }
4 3 { 6, 9, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, ... }
5 1 { 6, 9, 13, 8, 9, 10, 11, 12, 13, 14, 15, ... }
6 3 { 15, 13, 8, 9, 10, 11, 12, 13, 14, 15, ... }
7 4 { 15, 13, 17, 10, 11, 12, 13, 14, 15, ... }
8 5 { 15, 13, 17, 21, 12, 13, 14, 15, ... }
9 1 { 15, 13, 17, 21, 25, 14, 15, ... }
10 5 { 28, 17, 21, 25, 14, 15, ... }
PROG
(PARI) See Links section.
CROSSREFS
KEYWORD
nonn
AUTHOR
Rémy Sigrist, Nov 07 2020
STATUS
approved