A374214 a(n) is the minimum value of A347381 obtained among all proper divisors of n larger than 1, where A347381 is the distance from n to the nearest common ancestor of n and sigma(n) in the Doudna-tree (A005940). By convention a(1) = a(p) = 0 for all primes p.

0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 3, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 3, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 2, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 3, 0, 3

Offset

1,49

Comments

It seems that values 11, 14, 16, 17, 18, 29, 40, 47 and 48 are completely missing (see the "bandgaps" in the scatter plot), most likely as they are also missing from A374481. Not so for 49, whose first occurrence is a(146507), where 146507 = 239*613. Note that A374481(112) = A374204(613) = A347381(613) = 49.

Links

Antti Karttunen, Table of n, a(n) for n = 1..100000

Index entries for sequences related to sigma(n)

Formula

For composite n, a(n) = Min_{d|n, 1<d<n} A347381(d).

Prog

(PARI)
A064989(n) = {my(f); f = factor(n); if((n>1 && f[1, 1]==2), f[1, 2] = 0); for (i=1, #f~, f[i, 1] = precprime(f[i, 1]-1)); factorback(f)};
A252463(n) = if(!(n%2), n/2, A064989(n));
A347381(n) = if(1==n, 0, my(lista=List([]), i, k=n, stemvec, stemlen, sbr=sigma(n)); while(k>1, listput(lista, k); k = A252463(k)); stemvec = Vecrev(Vec(lista)); stemlen = #stemvec; while(1, if((i=vecsearch(stemvec, sbr))>0, return(stemlen-i)); sbr = A252463(sbr)));
A374214(n) = { my(m=-1, x); fordiv(n, d, if(d>1 && d<n, x = A347381(d); if(m<0 || x<m, m=x))); if(-1==m, 0, m); };

Crossrefs

Cf. A000004 (even bisection), A005940, A347381, A374200, A374204, A374215, A374481.

Sequence in context: A331414 A111025 A271620 * A098018 A260073 A196306

Adjacent sequences: A374211 A374212 A374213 * A374215 A374216 A374217

Keyword

nonn,look

Author

Antti Karttunen, Jul 07 2024

Status

approved