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 A257122 #19 May 04 2015 11:31:10 %S A257122 1,2,3,5,8,4,30,6,10,7,123,12,201,31,9,13,300,11,825,16,34,124,946,14, %T A257122 27,202,21,32,3094,15,7060,18,127,301,54,20,13528,826,205,17,28659,33, %U A257122 40811,125,25,947,46658,19,81,28,304,203,57450,22,134,38,829,3095 %N A257122 Smallest m such that A257218(m) = n. %C A257122 A257218(a(n)) = n and A257218(m) != n for m < a(n); %C A257122 it appears that all records > 8 occur at primes; %C A257122 for p prime: a(p)-1 = index of the smallest multiple of p in A257218. %H A257122 Hiroaki Yamanouchi, <a href="/A257122/b257122.txt">Table of n, a(n) for n = 1..72</a> %o A257122 (Haskell) %o A257122 import Data.List (elemIndex); import Data.Maybe (fromJust) %o A257122 a257122 = (+ 1) . fromJust . (`elemIndex` a257218_list) %Y A257122 Cf. A257218. %K A257122 nonn %O A257122 1,2 %A A257122 _Reinhard Zumkeller_, Apr 25 2015 %E A257122 a(41)-a(58) from _Hiroaki Yamanouchi_, May 04 2015