A262502 a(n) = least k such that A261104(k) = n; positions of records in A261104.

0, 1, 3, 7, 11, 17, 23, 31, 40, 50, 62, 74, 86, 98, 110, 126, 142, 158, 174, 192, 210, 228, 248, 268, 288, 308, 328, 348, 372, 396, 420, 444, 468, 492, 516, 540, 564, 588, 612, 636, 660, 684, 708, 738, 768, 798, 828, 860, 892, 924, 956, 988, 1020, 1052, 1084, 1116, 1148, 1180, 1212, 1244, 1280, 1316, 1352, 1388, 1424, 1460, 1496, 1532, 1568, 1604, 1640, 1676, 1716

Offset: 0

Author

Antti Karttunen, Sep 24 2015

Keywords

• nonn

Comments

a(n+2) should give a safe upper bound for A262503(n), and actually seems to significantly overshoot it when n grows.

Links

• Antti Karttunen, Table of n, a(n) for n = 0..1641

Crossrefs

Cf. A261104, A261089, A262503, A262507.

Cf. A262504 (first differences).

Formula

Other identities. For all n >= 0:

A261104(a(n)) = n.