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 A269368 #6 Feb 28 2016 07:59:43 %S A269368 1,2,3,5,4,9,6,10,7,14,8,11,13,18,23,20,12,19,17,22,15,30,16,27,32,34, %T A269368 29,21,37,25,85,39,40,38,24,33,41,43,28,36,26,31,46,62,69,61,35,80,45, %U A269368 63,44,60,81,73,42,66,49,51,47,71,87,93,129,53,54,58,48,50,52,88,67,72,86,59,55,57,74,82,76,104,106,84 %N A269368 a(n) = index of n in A269367 or 0 if n is not present in that sequence. %C A269368 If A269367 is really a permutation of natural numbers, then this sequence is also, and no hypothetical zero-values are ever needed. %H A269368 Antti Karttunen, <a href="/A269368/b269368.txt">Table of n, a(n) for n = 1..16382</a> %H A269368 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a> %o A269368 (Scheme) ;; Use the code in A269367. %Y A269368 Inverse: A269367. %Y A269368 Cf. also A266122, A269363. %K A269368 nonn,base %O A269368 1,2 %A A269368 _Antti Karttunen_, Feb 27 2016