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 A082881 #16 Jun 23 2025 02:59:25
%S A082881 0,2,5,2,5,2,5,7,2,7,2,2,5,2,2,2,7,2,2,5,2,3,2,5,3,13,2,5,3,2,2,2,3,2,
%T A082881 7,5,3,13,2,3,7,2,5,3,2,2,2,2,5,7,2,7,2,2,2,2,7,2,3,2,2,2,2,5,2,2,5,2,
%U A082881 19,2,2,2,5,2,2,3,2,3,2,2,17,2,5,5,2,2,2,7,23,2,2,3,3,3,5,2,2,19,2,5,2,3,2
%N A082881 Least value of A075860(j) when j runs through composite numbers between n-th and (n+1)-th primes. That is, the smallest fixed-point[=prime] reached by iteration of function A008472(=sum of prime factors) initiated with composite values between two consecutive primes.
%F A082881 a(n) = Min_{x=1+prime(n)..prime(n+1)-1} A075860(x).
%e A082881 Between p(23)=83 and p(24)=89, the relevant fixed points are {5,13,2,2,13}, of which the smallest is 2=a(24).
%t A082881 ffi[x_] := Flatten[FactorInteger[x]]; lf[x_] := Length[FactorInteger[x]]; ba[x_] := Table[Part[ffi[x], 2*w-1], {w, 1, lf[x]}]; sopf[x_] := Apply[Plus, ba[x]]; Table[Min[Table[FixedPoint[sopf, w], {w, 1+Prime[n], Prime[n+1]-1}]], {n, 2, 103}]
%Y A082881 Cf. A075860, A008472, A082087, A082088, A082880, A029908.
%K A082881 nonn
%O A082881 1,2
%A A082881 _Labos Elemer_, Apr 16 2003