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 A263266 #21 Dec 03 2015 04:33:55 %S A263266 0,1,2,3,4,6,5,11,7,8,9,12,10,15,13,16,17,20,14,26,18,27,19,30,21,22, %T A263266 23,34,24,38,25,46,28,47,29,50,39,54,31,55,32,59,33,67,35,60,36,68,37, %U A263266 40,41,74,42,81,43,82,44,88,48,95,45,103,51,96,97,108,52,114,56,115,57,120,49,128,61,121,62,138,63,145,64,69,70,75,53 %N A263266 Inverse permutation to A263265: a(0) = 0; for n >= 1, a(n) = A263259(n) + A263260(A155043(n)-1) - 1. %H A263266 Antti Karttunen, <a href="/A263266/b263266.txt">Table of n, a(n) for n = 0..131071</a> %H A263266 A. Karttunen, <a href="/A263266/a263266.png">Graph plotted with OEIS Plot script up to n=10000</a> %H A263266 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a> %F A263266 a(0) = 0; for n >= 1, a(n) = A263259(n) + A263260(A155043(n)-1) - 1. %o A263266 (Scheme) %o A263266 (define (A263266 n) (if (zero? n) n (+ -1 (A263259 n) (A263260 (- (A155043 n) 1))))) %Y A263266 Inverse: A263265. %Y A263266 Cf. A263281 (fixed points). %Y A263266 Cf. A155043, A263259, A263260. %Y A263266 Differs from A263268 for the first time at n=38, where a(38) = 31, while A263268(38) = 32. %K A263266 nonn,look %O A263266 0,3 %A A263266 _Antti Karttunen_, Nov 24 2015