%I #15 Jul 10 2017 22:59:08

%S 2,4,5,9,10,18,20,21,40,42,48,96,67,84,145,134,148,193,168,290,268,

%T 336,296,386,328,592,580,536,584,645,552,771,585,772,656,1184,1156,

%U 1104,1542,1096,1031,1160,1072,1161,2069,1544,1312,2368,1288,1170,1792,1216,1290,2340,2240,2309,3136,4480,2144,2185,3104,2193,2062,2320,2208,2313,2210

%N First members of "good matches" produced by match-making permutation: a(n) = A266195(A266197(n)).

%C Note that a number occurs both here and in A265749 if and only if it is a good match both with its predecessor and the successor in A266195.

%H Rémy Sigrist, <a href="/A265748/b265748.txt">Table of n, a(n) for n = 1..10000</a> (first 154 terms from Antti Karttunen)

%F a(n) = A266195(A266197(n)).

%F Other identities. For all n >= 1:

%F A070939(a(n)) = A070939(A265749(n)). [By definition of "good match" in this context.]

%o (Scheme) (define (A265748 n) (A266195 (A266197 n)))

%Y Cf. A070939, A266195, A266197.

%Y Cf. A265749 (for the latter member).

%Y Cf. also A235034, A235035.

%K nonn,base

%O 1,1

%A _Antti Karttunen_, Dec 26 2015