This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A262502 #14 Oct 02 2015 12:08:42 %S A262502 0,1,3,7,11,17,23,31,40,50,62,74,86,98,110,126,142,158,174,192,210, %T A262502 228,248,268,288,308,328,348,372,396,420,444,468,492,516,540,564,588, %U A262502 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 %N A262502 a(n) = least k such that A261104(k) = n; positions of records in A261104. %C A262502 a(n+2) should give a safe upper bound for A262503(n), and actually seems to significantly overshoot it when n grows. %H A262502 Antti Karttunen, <a href="/A262502/b262502.txt">Table of n, a(n) for n = 0..1641</a> %F A262502 Other identities. For all n >= 0: %F A262502 A261104(a(n)) = n. %o A262502 (Scheme, with _Antti Karttunen_'s IntSeq-library, two variants) %o A262502 (define A262502 (RECORD-POS 0 0 A261104)) %o A262502 (definec (A262502 n) (let loop ((k 0)) (if (= n (A261104 k)) k (loop (+ 1 k))))) %Y A262502 Cf. A261104, A261089, A262503, A262507. %Y A262502 Cf. A262504 (first differences). %K A262502 nonn %O A262502 0,3 %A A262502 _Antti Karttunen_, Sep 24 2015