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 A277816 #9 Nov 07 2016 09:11:28 %S A277816 0,5,10,39,20,13,78,11,40,21,26,19,156,29,22,27,80,25,42,35,52,45,38, %T A277816 43,312,37,58,51,44,41,54,59,160,57,50,67,84,53,70,75,104,61,90,79,76, %U A277816 93,86,55,624,101,74,99,116,77,102,71,88,69,82,115,108,85,118,123,320,121,114,131,100,117,134,91,168,89,106,147,140,109,150,83,208,105 %N A277816 a(n) = the least k > n for which A264977(k) = A264977(n), or 0 if no such k exists. %H A277816 Antti Karttunen, <a href="/A277816/b277816.txt">Table of n, a(n) for n = 0..65537</a> %F A277816 For all n >= 0, A277815(a(n)) = n. %o A277816 (Scheme) %o A277816 (define (A277816 n) (if (zero? n) n (let ((v (A264977 n))) (let loop ((k (+ 1 n))) (if (= v (A264977 k)) k (loop (+ 1 k))))))) %Y A277816 Cf. A264977, A277710, A277814, A277816, A277826, A277696. %Y A277816 Cf. A277815 (a left inverse). %Y A277816 Cf. A277701, A277712, A277713, A277715 (iterates of this sequence starting from 1, 2, 3 and 9 respectively). %K A277816 nonn %O A277816 0,2 %A A277816 _Antti Karttunen_, Nov 06 2016