login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A130836 Square array d(m,n) = multiplicative distance between m>=1 and n>=1, read by antidiagonals. 4

%I

%S 0,1,1,1,0,1,2,2,2,2,1,1,0,1,1,2,2,3,3,2,2,1,1,2,0,2,1,1,3,2,1,3,3,1,

%T 2,3,2,2,2,2,0,2,2,2,2,2,3,4,3,3,3,3,4,3,2,1,1,1,1,2,0,2,1,1,1,1,3,2,

%U 3,4,4,3,3,4,4,3,2,3,1,2,2,2,3,3,0,3,3,2,2,2,1,2,2,2,3,1,2,4,4,2,1,3,2,2,2

%N Square array d(m,n) = multiplicative distance between m>=1 and n>=1, read by antidiagonals.

%C If m = p_1^e_1 * p_2^e_2 * ... * p_k^e^k and n = p_1^f_1 * p_2^f_2 * ... * p_k^f^k, we define d(m, n) = Sum_{i = 1..k} |e_i - f_i| to be the multiplicative distance between m and n (see A130849).

%C Equivalently, if m/n = Product p_k^e_k, then d(m,n) = Sum |e_k|. - _M. F. Hasler_, Dec 08 2019

%H Robert Israel, <a href="/A130836/b130836.txt">Table of n, a(n) for n = 1..10011</a> (first 141 antidiagonals, flattened)

%H D. Dominici, <a href="http://arxiv.org/abs/0906.0632">An Arithmetic Metric</a>, arXiv:0906.0632 [math.NT], 2009.

%F a(n,m) = A127185(n,m). - _R. J. Mathar_, Oct 17 2007

%e Array begins:

%e 0 1 1 2 1 2 1 3 ...

%e 1 0 2 1 2 1 2 2 ...

%e 1 2 0 3 2 1 2 4 ...

%e 2 1 3 0 3 2 3 1 ...

%e ...

%p A001222 := proc(n) numtheory[bigomega](n) ; end: A127185 := proc(n,m) local g ; g := gcd(n,m) ; RETURN(A001222(n/g)+A001222(m/g)) ; end: A130836 := proc(n,m) A127185(n,m) ; end: for d from 1 to 17 do for n from 1 to d do printf("%d, ",A130836(n,d-n+1)) ; od: od: # _R. J. Mathar_, Oct 17 2007

%p g:= proc(s) local t;

%p if s = 1 then 0

%p elif type(s,function) then 1

%p elif type(s,`^`) then abs(op(2,s))

%p else add(procname(t),t=s)

%p fi

%p end proc:

%p f:= (m,n) -> g(ifactor(m)/ifactor(n)):

%p seq(seq(f(m,n-m),m=1..n-1), n=1..20); # _Robert Israel_, Sep 17 2018

%t t[n_, n_] = 0; t[n_, 1] := PrimeOmega[n]; t[n_, m_] := With[{g = GCD[n, m]}, PrimeOmega[n/g] + PrimeOmega[m/g]]; Table[t[n-m+1, m], {n, 1, 14}, {m, 1, n}] // Flatten (* _Jean-Fran├žois Alcover_, Jan 17 2014, after _R. J. Mathar_ *)

%o (PARI) T(m, n) = {if (m==n, 0, my(f=vecsort(concat(factor(m)[, 1], factor(n)[, 1]),, 8)); sum(i=1, #f, abs(valuation(m, f[i])-valuation(n, f[i]))))}; \\ _Michel Marcus_, Sep 20 2018

%o (PARI) A130836(m,n)=vecsum(abs(factor(m/n)[,2])) \\ _M. F. Hasler_, Dec 07 2019

%Y Half of antidiagonal sums gives A130849. First row is A001222.

%K nonn,tabl,easy

%O 1,7

%A _N. J. A. Sloane_, Sep 28 2007

%E More terms from _R. J. Mathar_, Oct 17 2007

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 14 15:19 EDT 2021. Contains 345025 sequences. (Running on oeis4.)