A265749 Second members of "good matches" produced by match-making permutation: a(n) = A266195(1+A266197(n)).

3, 5, 6, 10, 12, 20, 19, 24, 35, 48, 37, 69, 84, 97, 134, 160, 193, 164, 194, 268, 320, 385, 386, 297, 387, 770, 536, 641, 519, 608, 771, 648, 560, 594, 774, 1539, 1104, 1542, 1105, 1031, 1160, 1072, 1161, 1552, 2120, 1061, 1548, 3074, 1043, 1120, 1097, 1290, 1600, 2240, 2309, 3136, 2569, 4168, 2185, 3104, 2192, 2062, 2320, 2055, 2313, 2210, 3084

Offset: 1

Author

Antti Karttunen, Dec 26 2015

Keywords

• nonn

Comments

Note that a number occurs both here and in A265748 if it is a good match both with its precedent and the successor in A266195.

Links

• Rémy Sigrist, Table of n, a(n) for n = 1..10000 (first 154 terms from Antti Karttunen)

Crossrefs

Cf. A070939, A266195, A266197.

Cf. A265748 (for the first member).

Cf. also A235034, A235035.

Programs

Scheme

(define (A265749 n) (A266195 (+ 1 (A266197 n))))

Formula

a(n) = A266195(1+A266197(n)).

Other identities. For all n >= 1:

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