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 A269365 #12 Mar 01 2016 23:08:14 %S A269365 1,2,3,4,6,5,7,8,12,14,13,9,16,25,11,10,28,18,29,24,36,15,51,17,30,56, %T A269365 27,33,32,37,103,26,22,74,49,50,52,19,59,20,102,48,57,31,54,23,75,21, %U A269365 58,34,55,72,66,53,149,65,112,118,73,105,104,61,597,206,204,108,119,96,114,41,39,38,40,148,35,45,116,205,115,64 %N A269365 a(n) = index of n in A269366 or 0 if n is not present in that sequence. %C A269365 If A269366 is really a permutation of natural numbers, then this sequence is also, and no hypothetical zero-values are ever needed. %H A269365 Antti Karttunen, <a href="/A269365/b269365.txt">Table of n, a(n) for n = 1..1442</a> %H A269365 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a> %o A269365 (Scheme) ;; Use the code given in A269366, with _Antti Karttunen_'s IntSeq-library. %Y A269365 Inverse: A269366. %K A269365 nonn,base %O A269365 1,2 %A A269365 _Antti Karttunen_, Feb 25 2016