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 A259537 #6 Jun 30 2015 04:54:51 %S A259537 1,56,48,147,148,49,55,2,8,14,20,26,32,38,33,27,21,15,9,3,66,50,149, %T A259537 158,177,57,74,88,102,116,130,45,44,131,117,103,89,75,58,178,157,150, %U A259537 51,65,4,10,16,22,28,34,39,139,125,111,97,83,496,186,196,163,173 %N A259537 Smallest m such that A259429(m) = 2*n-1. %C A259537 Sequence is defined for all numbers iff A259429 is a permutation of the odd numbers; %C A259537 A259429(a(n)) = 2*n-1. %H A259537 Reinhard Zumkeller, <a href="/A259537/b259537.txt">Table of n, a(n) for n = 1..10000</a> %o A259537 (Haskell) %o A259537 import Data.List (elemIndex); import Data.Maybe (fromJust) %o A259537 a259537 = (+ 1) . fromJust . (`elemIndex` a259429_list) . subtract 1 . (* 2) %Y A259537 Cf. A259429. %K A259537 nonn %O A259537 1,2 %A A259537 _Reinhard Zumkeller_, Jun 30 2015