cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-4 of 4 results.

A347381 Distance from n to the nearest common ancestor of n and sigma(n) in the Doudna-tree (A005940).

Original entry on oeis.org

0, 0, 1, 1, 1, 0, 3, 2, 2, 3, 3, 2, 2, 3, 1, 3, 6, 3, 5, 1, 4, 5, 7, 2, 3, 4, 3, 0, 8, 4, 10, 4, 4, 7, 2, 4, 4, 7, 3, 4, 10, 4, 9, 4, 3, 9, 13, 4, 4, 4, 7, 7, 15, 4, 5, 5, 6, 9, 15, 4, 7, 10, 3, 5, 4, 6, 12, 6, 8, 5, 19, 5, 9, 6, 4, 8, 3, 5, 19, 4, 3, 11, 20, 4, 7, 11, 9, 6, 22, 4, 4, 8, 11, 15, 7, 5, 24, 5, 3, 5, 20
Offset: 1

Views

Author

Antti Karttunen, Aug 30 2021

Keywords

Comments

a(n) tells about the degree of relatedness between n and sigma(n) in Doudna tree (see the illustration in A005940). It is 0 for those n where sigma(n) is one of the descendants of n, 1 for those n where the nearest common ancestor of n and sigma(n) is the parent of n, 2 for those n where the nearest common ancestor of n and sigma(n) is the grandparent of n, and so on.

Crossrefs

Indices of 0 .. 5 in this sequence are given by {2} U A336702, A347391, A347392, A347393, A347394, A374465.
Cf. A000203, A027687, A156552, A252463, A252464, A332221, A347380, A347383, A347384, A347390, A374481 [a(prime(n))], A374482 (indices of records), A374483 (record values).
Cf. also A336834.

Programs

  • PARI
    A000523(n) = logint(n,2);
    Abincompreflen(x, y) = if(!x || !y, 0, my(xl=A000523(x), yl=A000523(y), s=min(xl,yl), k=0); x >>= (xl-s); y >>= (yl-s); while(s>=0 && !bitand(1,bitxor(x>>s,y>>s)), s--; k++); (k));
    A156552(n) = {my(f = factor(n), p, p2 = 1, res = 0); for(i = 1, #f~, p = 1 << (primepi(f[i, 1]) - 1); res += (p * p2 * (2^(f[i, 2]) - 1)); p2 <<= f[i, 2]); res}; \\ From A156552
    A061395(n) = if(n>1, primepi(vecmax(factor(n)[, 1])), 0);
    A252464(n) = if(1==n,0,(bigomega(n) + A061395(n) - 1));
    A347381(n) = (A252464(n)-Abincompreflen(A156552(n), A156552(sigma(n))));
    
  • 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)));

Formula

a(n) = A252464(n) - A347380(n), where A347380(n) is the length of the common prefix in binary expansions of A156552(n) and A332221(n) = A156552(sigma(n)).

Extensions

Name changed, old name is now in formula section. - Antti Karttunen, Jul 09 2024

A347391 Numbers k such that sigma(k) is either their sibling in Doudna tree (A005940), or one of the sibling's descendants.

Original entry on oeis.org

3, 4, 5, 15, 20, 189, 945, 2125, 6375, 9261, 46305, 401625, 19679625
Offset: 1

Views

Author

Antti Karttunen, Aug 30 2021

Keywords

Comments

Numbers k > 1 such that nearest common ancestor of k and sigma(k) in Doudna tree is the parent of k, and sigma(k) is not a descendant of k.
Any hypothetical odd term x in A005820 (triperfect numbers) would also be a member of this sequence. This is illustrated in the following diagram which shows how the neighborhood of such x would look like in the Doudna tree (A005940). If m (the parent of x, x = A003961(m), m = A064989(x)) is even, then x is a multiple of 3, while if m is odd, then 3 does not divide x. Because the abundancy index decreases when traversing leftwards in the Doudna tree, m must be a term of A068403. Both x and m would also need to be squares, by necessity.
.
<--A003961-- m ---(*2)--->
.............../ \...............
/ \
/ \
x 2m
/ \ / \
etc.../ \.....2x sigma(x) = 3x..../ \.....4m
/ \ / \ / \
etc. etc. etc. \ / etc.
\ /
6x 9x = sigma(2x)
/ \ / \
etc. \ etc. etc.
\
12x = sigma(3x) if m odd.
.
From the diagram we also see that 2x would then need to be a term of A347392 (as well as that of A159907 and also in A074388, thus sqrt(x) should be a term of A097023), and furthermore, if x is not a multiple of 3 (i.e., when m is odd), then sigma(3*x) = 4*sigma(x) = 4*(3*x), thus 3*x = sigma(x) would be a term of A336702 (particularly, in A027687) and x would be a term of A323653.
Moreover, any odd square x in this sequence (for which sigma(x) would also be odd), would have an abundancy index of at least three (sigma(x)/x >= 3). See comments in A347383.
Note how 401625 = 6375 * 63 = 945 * 425, 46305 = 945 * 49, 9261 = 189 * 49, 6375 = 2125 * 3, 945 = 189 * 5 = 15 * 63 and 9261*2125 = 19679625. It seems that when the multiplicands are coprime, then they are both terms of this sequence, e.g. 2125 and 3, 189 and 5, 2125 and 9261.
From Antti Karttunen, Jul 10 2024: (Start)
Regarding the observation above, for two coprime odd numbers x, y, if both are included here because sigma(x) = 2^a * A064989(x) and sigma(y) = 2^b * A064989(y), then also their product x*y is included because in that case sigma(x*y) = 2^(a+b) * A064989(x*y).
Also, for two coprime odd numbers x, y, if both are included here because sigma(x) = A065119(i) * x and sigma(y) = A065119(j) * y, then also their product x*y is included because sigma(x*y) = A065119(k) * x*y, where A065119(k) = A065119(i)*A065119(j). The existence of such numbers (that would include odd triperfect and odd 6-perfect numbers, see A046061) is so far hypothetical, none is known.
It is not possible that the odd x is in this sequence if sigma(x) = k*A003961^e(x) and e = A061395(k)-2 >= 1.
Note that all odd terms < 2^33 here are some of the exponentially odd divisors of 19679625 (see A374199, also A374463 and A374464).
(End)
Question: from a(6) = 189 onward, are the rest of terms all in A347390?
Conjecture: sequence is finite.
If it exists, a(14) > 2^33.

Examples

			Sigma(3) = 4 is located as the sibling of 3 in the Doudna-tree (see the illustration in A005940), thus 3 is included in this sequence.
Sigma(4) = 7 is located as a grandchild of 3 (which is the sibling of 4) in the Doudna-tree, thus 4 is included in this sequence.
Sigma(5) = 6 is located as the sibling of 5 in the Doudna-tree, thus 5 is included in this sequence.
189 (= 3^3 * 7) is a term, as sigma(189) = 320, and 320 occurs as a descendant of 80 (which is the right sibling of 189) in the Doudna tree, as illustrated below:
.
             40
            /  \
   A003961 /    \ *2
          /      \
        189       80
        / \      / \
     etc   etc etc  160
                   / \
                 etc  320
                     / \
                   etc. etc.
.
945 (= 3^3 * 5 * 7) is a term, as sigma(945) = 1920, and 1920 occurs as a descendant of 240, which is the right sibling of 945 in the Doudna tree, as illustrated below:
            120
            /  \
   A003961 /    \ *2
          /      \
        945       240
        / \      / \
     etc   etc  etc  480
                   / \
                 etc  960
                     / \
                   etc. 1920
                        / \
                     etc. etc.
		

Crossrefs

Programs

  • PARI
    isA347391(n) = (1==A347381(n));
    
  • 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));
    isA347391(n) = if(1==n,0,my(m=A252463(n), s=sigma(n)); while(s>m, if(s==n, return(0)); s = A252463(s)); (s==m));

A347383 Odd composites k, not powers of primes, such that for all their nontrivial unitary divisors d it holds that A347381(d) > A347381(k).

Original entry on oeis.org

189, 1271, 2125, 9261, 63767, 133907, 142859, 161257, 189209, 226967, 368063, 426373, 777923, 801727, 925101, 961193, 1003043, 4566661, 5244091, 5588327, 6031163, 6064439, 8135263, 8639879, 10074227, 10150571, 11234875, 12489107, 16016003, 19765547, 22635539
Offset: 1

Views

Author

Antti Karttunen, Sep 10 2021

Keywords

Comments

Here nontrivial unitary divisor d of k means any divisor d|k, such that 1 < d < k and gcd(d, k/d) = 1.
Any hypothetical odd term x in A005820 (triperfect numbers) would also be a member of this sequence. Proof: such an odd number cannot be a prime power (although it must be a square), thus it must have at least two nontrivial unitary divisors (with A034444(x) >= 4). Because sigma(x) = 3*x, it must be a term of A347391. From the illustration given there, we see that any odd square y in that sequence (i.e. with A347381(y)=1) would have an abundancy index of at least three (sigma(y)/y >= 3). But because abundancy index is multiplicative and always > 1 for n > 1, any nontrivial unitary divisor d of an odd triperfect number x must have sigma(d)/d < 3, thus for all such d, A347381(d) <> 1. And neither such divisor d can be a term of A336702, because 3*x is odd, therefore we must have A347381(d) > 1 for all nontrivial unitary divisors d of such a hypothetical x.
Any odd term of A000396, i.e., an odd perfect number, if such a hypothetical number exists, must also be a term of this sequence, by reasoning similar to above. See also illustration in A347392.

Examples

			189 is a term, because A347381(189) = 1, and the only way to factor 189 into nontrivial unitary divisors is 7*27, and A347381(7) = A347381(27) = 3 > 1.
63767 = 11^2 * 17 * 31 is a term, as its nontrivial unitary divisors are [17, 31, 121, 527, 2057, 3751], at which points A347381 obtains values [6, 10, 5, 11, 6, 8], every one which is larger than A347381(63767) = 3.
		

Crossrefs

Subsequence of A347390, which is a subsequence of A347384.

Programs

  • PARI
    isA347383(n) = if((1==n)||!(n%2)||isprimepower(n),0,my(w=A347381(n)); fordiv(n,d,if((d>1)&&(dA347381(d)<=w), return(0))); (1));

Extensions

a(29)-a(31) from Jinyuan Wang, Jul 09 2025

A347384 Odd numbers k with such a unitary divisor d that A347381(d) > A347381(k).

Original entry on oeis.org

35, 105, 153, 189, 207, 279, 403, 423, 425, 437, 455, 475, 477, 575, 589, 639, 689, 725, 765, 775, 819, 833, 899, 923, 945, 963, 1025, 1035, 1071, 1127, 1143, 1175, 1209, 1271, 1275, 1311, 1325, 1341, 1365, 1391, 1395, 1421, 1425, 1449, 1475, 1495, 1519, 1651, 1719, 1725, 1739, 1767, 1775, 1791, 1881, 1927, 1953, 1961
Offset: 1

Views

Author

Antti Karttunen, Sep 10 2021

Keywords

Examples

			35 is a product of two primes, 5 and 7, with A347381(7) = 3 > A347381(35) = 2, therefore 35 is included in this sequence.
		

Crossrefs

Cf. A347381.
Subsequences: A347390, A347383.

Programs

  • PARI
    isA347384(n) = if(!(n%2),0,my(w=A347381(n)); fordiv(n,d,if(1==gcd(d,n/d) && (A347381(d)>w), return(1))); (0));
Showing 1-4 of 4 results.