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 A340997 #8 Feb 02 2021 11:37:55 %S A340997 1,5,8,16,26,24,36,48,54,60,84,96,90,132,144,120,174,150,168,180,246, %T A340997 234,240,210,270,342,300,324,396,378,330,468,390,450,618,462,420,654, %U A340997 594,540,510,546,786,702,726,768,630,690,660,1078,858,936,798,780,930,1008,900,1164,1056,966,840,1278 %N A340997 a(n) is the first k such that A340996(k) = n. %H A340997 Robert Israel, <a href="/A340997/b340997.txt">Table of n, a(n) for n = 0..1000</a> %F A340997 A340996(a(n)) = n. %e A340997 a(3) = 16 as A340996(16) = 3 and this is the first occurrence of 3 in A340996. %p A340997 f:= proc(n) local k; nops(select(isprime,{seq(n mod k, k=select(isprime,[$2..n-1]))})) end proc: %p A340997 V:= Array(0..100): %p A340997 count:= 0: %p A340997 for n from 1 while count < 101 do %p A340997 v:= f(n); %p A340997 if v <= 100 and V[v] = 0 then V[v]:= n; count:= count+1; %p A340997 od: %p A340997 convert(V,list); %Y A340997 Cf. A340996. %K A340997 nonn %O A340997 0,2 %A A340997 _J. M. Bergot_ and _Robert Israel_, Feb 01 2021