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 A285123 #8 Dec 12 2023 14:16:26 %S A285123 0,1,0,1,3,1,0,3,9,3,1,0,3,1,21,9,27,4,5,3,1,7,39,3,4,0,11,51,3,6,5,3, %T A285123 9,17,33,5,1,9,81,39,87,3,9,4,0,7,1,31,111,7,21,3,1,15,0,129,63,3,11, %U A285123 6,41,69,1,21,11,75,7,5,171,17,6,177,55,19,3 %N A285123 Min(|d(k+1-i) - d(i)|, for i = 1..k), where d(1),..,d(k) are the divisors of prime(n) - 1. %H A285123 Clark Kimberling, <a href="/A285123/b285123.txt">Table of n, a(n) for n = 1..10000</a> %F A285123 a(n)=A056737(A000578(n)). %e A285123 prime(6) - 1 = 12 has divisors 1,2,3,4,6,12, so that k=6 and d(k+1-i) - d(i) ranges through {-11, -4, -1, 1, 4, 11}, so that a(6) = 1. %t A285123 f[n_] := f[n] = Prime[n]-1; %t A285123 Table[Divisors[f[n]] - Reverse[Divisors[f[n]]], {n, 1, 10}] %t A285123 Table[Min[Abs[Divisors[f[n]] - Reverse[Divisors[f[n]]]]], {n, 1, 100}] %Y A285123 Cf. A006093, A002378, A056737. %K A285123 nonn,easy %O A285123 1,5 %A A285123 _Clark Kimberling_, Apr 11 2017