|
%I #13 Nov 07 2016 11:05:08
%S 0,1,2,3,4,1,6,7,8,9,2,7,12,1,14,15,16,17,18,7,4,9,14,23,24,17,2,15,
%T 28,1,30,31,32,33,34,7,36,17,14,3,8,1,18,23,28,9,46,47,48,49,34,15,4,
%U 17,30,47,56,33,2,31,60,1,62,63,64,65,66,7,68,33,14,47,72,73,34,3,28,17,6,23,16,81,2,23,36,1,46,87,56,73,18,47,92,9
%N a(n) = the least k for which A264977(k) = A264977(n).
%H Antti Karttunen, <a href="/A277826/b277826.txt">Table of n, a(n) for n = 0..65537</a>
%o (Scheme)
%o (define (A277826 n) (let ((v (A264977 n))) (let loop ((k 0)) (if (= v (A264977 k)) k (loop (+ 1 k))))))
%Y Cf. A264977, A277816.
%Y Cf. A277701, A277712, A277713, A277715 (positions of 1, 2, 3 and 9 in this sequence).
%Y Cf. A277824, A277884 and their scatter-plots.
%K nonn,look
%O 0,3
%A _Antti Karttunen_, Nov 06 2016
|
