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 A259526 #7 Jun 30 2015 04:55:45 %S A259526 1,6,7,2,12,3,8,20,21,9,4,13,45,14,5,10,22,27,28,23,11,50,15,46,42,47, %T A259526 16,51,33,24,29,61,60,30,25,34,52,17,48,41,88,105,49,18,53,35,26,31, %U A259526 67,62,63,68,32,58,36,54,19,91,106,87,111,94,107,90,120,55 %N A259526 Smallest m such that A259260(m) = 2*n-1. %C A259526 Sequence is defined for all numbers iff A259260 is a permutation of the odd numbers; %C A259526 A259260(a(n)) = 2*n-1. %H A259526 Reinhard Zumkeller, <a href="/A259526/b259526.txt">Table of n, a(n) for n = 1..10000</a> %o A259526 (Haskell) %o A259526 import Data.List (elemIndex); import Data.Maybe (fromJust) %o A259526 a259526 = (+ 1) . fromJust . (`elemIndex` a259260_list) . subtract 1 . (* 2) %Y A259526 Cf. A259260. %K A259526 nonn %O A259526 1,2 %A A259526 _Reinhard Zumkeller_, Jun 29 2015