login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A285119 Min(|d(k+1-i) - d(i)|, for i = 1..k), where d(1)..d(k) are the divisors of n^3. 1

%I #15 Dec 12 2023 14:17:42

%S 0,2,6,0,20,6,42,16,0,15,110,12,156,7,30,0,272,9,342,20,84,33,506,20,

%T 0,65,162,84,812,30,930,128,176,153,70,0,1332,209,182,6,1640,42,1806,

%U 110,132,345,2162,96,0,250,170,78,2756,162,330,56,152,609,3422

%N Min(|d(k+1-i) - d(i)|, for i = 1..k), where d(1)..d(k) are the divisors of n^3.

%C a(n) = 0 if and only if n is a square (A000290).

%H Clark Kimberling, <a href="/A285119/b285119.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) = A056737(A000578(n)).

%e 3^3 = 27 has divisors 1,3,9,27, so that k=4 and d(k+1-i) - d(i) ranges through {-26,-6,6,27}, so that a(3) = 6.

%t f[n_] := f[n] = n^3; Table[Divisors[f[n]] - Reverse[Divisors[f[n]]], {n, 1, 10}]

%t Table[Min[Abs[Divisors[f[n]] - Reverse[Divisors[f[n]]]]], {n, 1, 100}]

%o (PARI) a(n) = my(d=divisors(n^3)); vecmin(apply(abs, d - Vecrev(d))); \\ _Michel Marcus_, Feb 22 2021

%Y Cf. A002378, A000578, A056737.

%K nonn,look,easy

%O 1,2

%A _Clark Kimberling_, Apr 11 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 06:16 EDT 2024. Contains 371782 sequences. (Running on oeis4.)