cp's OEIS Frontend

A109322 a(n) is the minimum positive integer j such that [j, j+n-1] does not contain any values of sigma(k) (i.e., sum of all positive divisors of k).

%I A109322 #24 Apr 30 2025 23:12:28
%S A109322 2,9,9,49,49,423,423,423,423,1333,1333,4425,4425,4425,4425,8763,8763,
%T A109322 14089,14089,22825,22825,22825,22825,40291,40291,40291,40291,40291,
%U A109322 40291,178705,178705,661285,661285,661285,661285,4543141,4543141,4543141,4543141,4543141,4543141,4543141,4543141,4543141,4543141,4543141,4543141
%N A109322 a(n) is the minimum positive integer j such that [j, j+n-1] does not contain any values of sigma(k) (i.e., sum of all positive divisors of k).
%H A109322 Donovan Johnson, <a href="/A109322/b109322.txt">Table of n, a(n) for n = 1..85</a> (terms < 10^10)
%H A109322 Art of Problem Solving, <a href="https://artofproblemsolving.com/community/c6h26906">Gaps in {sigma(n)}...</a>
%Y A109322 Cf. A002191, A083531, A109323, A109324, A110875.
%K A109322 nonn
%O A109322 1,1
%A A109322 _Max Alekseyev_ and _Jud McCranie_, Aug 08 2005