login
Smallest difference between consecutive anti-divisors of n (ordered by size).
0

%I #10 Feb 03 2020 03:50:01

%S 0,0,0,0,1,0,1,2,4,1,1,3,1,1,4,8,1,1,1,5,4,1,1,9,1,1,1,2,1,8,1,2,1,1,

%T 1,16,1,1,1,6,1,1,1,5,1,1,1,13,1,1,4,1,1,8,1,13,1,1,1,1,1,1,1,40,1,3,

%U 1,1,4,1,1,2,1,1,4,1,1,1,1,4,1,1,1,5,1,1

%N Smallest difference between consecutive anti-divisors of n (ordered by size).

%C See A066272 for definition of anti-divisor.

%e For n=13, anti-divisors={2,3,5,9}; differences={1,2,4}; a(13) = smallest difference = 1.

%t min[s_] := If[Length[s] > 0, Min[s], 0]; min /@ Differences /@ Table[Select[Range[2, n - 1], Abs[Mod[n, #] - #/2] < 1 &], {n, 100}] (* _Amiram Eldar_, Feb 03 2020 after _Harvey P. Dale_ at A066272 *)

%Y Cf. A066272, A130799.

%K nonn

%O 1,8

%A _Jason Earls_, Sep 06 2002

%E More terms from _Amiram Eldar_, Feb 03 2020