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 A265749 #14 Jul 10 2017 22:59:14 %S A265749 3,5,6,10,12,20,19,24,35,48,37,69,84,97,134,160,193,164,194,268,320, %T A265749 385,386,297,387,770,536,641,519,608,771,648,560,594,774,1539,1104, %U A265749 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 %N A265749 Second members of "good matches" produced by match-making permutation: a(n) = A266195(1+A266197(n)). %C A265749 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. %H A265749 Rémy Sigrist, <a href="/A265749/b265749.txt">Table of n, a(n) for n = 1..10000</a> (first 154 terms from Antti Karttunen) %F A265749 a(n) = A266195(1+A266197(n)). %F A265749 Other identities. For all n >= 1: %F A265749 A070939(a(n)) = A070939(A265748(n)). [By definition of "good match" in this context.] %o A265749 (Scheme) (define (A265749 n) (A266195 (+ 1 (A266197 n)))) %Y A265749 Cf. A070939, A266195, A266197. %Y A265749 Cf. A265748 (for the first member). %Y A265749 Cf. also A235034, A235035. %K A265749 nonn %O A265749 1,1 %A A265749 _Antti Karttunen_, Dec 26 2015