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
Antti Karttunen, Table of n, a(n) for n = 0..1641
FORMULA
Other identities. For all n >= 0:
A261104(a(n)) = n.
PROG
(Scheme, with Antti Karttunen's IntSeq-library, two variants)
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, Sep 24 2015
STATUS
approved