login
A262502
a(n) = least k such that A261104(k) = n; positions of records in A261104.
5
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,3
COMMENTS
a(n+2) should give a safe upper bound for A262503(n), and actually seems to significantly overshoot it when n grows.
LINKS
FORMULA
Other identities. For all n >= 0:
A261104(a(n)) = n.
PROG
(Scheme, with Antti Karttunen's IntSeq-library, two variants)
(define A262502 (RECORD-POS 0 0 A261104))
(definec (A262502 n) (let loop ((k 0)) (if (= n (A261104 k)) k (loop (+ 1 k)))))
CROSSREFS
Cf. A262504 (first differences).
Sequence in context: A047838 A188653 A333996 * A211076 A180452 A294479
KEYWORD
nonn
AUTHOR
Antti Karttunen, Sep 24 2015
STATUS
approved