A138302 -id:A138302 - cp's OEIS frontend

A368979 The number of exponential divisors of n that are exponentially odd numbers (A268335).

1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1

Offset: 1

Amiram Eldar, Jan 11 2024

First differs from A367516 at n = 128, and from A359411 at n = 512.

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A001227, A008578, A049419, A138302, A268335, A322791, A368980.
Cf. A359411, A367516.
Similar sequences: A055076, A322483, A363825, A368977.

f[p_, e_] := DivisorSigma[0, e/2^IntegerExponent[e, 2]]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]

a(n) = vecprod(apply(x -> numdiv(x >> valuation(x, 2)), factor(n)[, 2]));

Multiplicative with a(p^e) = A001227(e).
a(n) >= 1, with equality if and only if n is in A138302.
a(n) <= A049419(n), with equality if and only if n is noncomposite (A008578).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Product_{p prime} (1 + Sum_{k>=2} (d(k) - d(k-1))/p^k) = 1.13657098749361390865..., where d(k) is the number of odd divisors of k (A001227).

A369938 Numbers whose maximal exponent in their prime factorization is a power of 2.

Original entry on oeis.org

2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 25, 26, 28, 29, 30, 31, 33, 34, 35, 36, 37, 38, 39, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 55, 57, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 73, 74, 75, 76, 77

Offset: 1

Amiram Eldar, Feb 06 2024

First differs from its subsequence A138302 \ {1} at n = 378: a(378) = 432 = 2^4 * 3^3 is not a term of A138302.
First differs from A096432, A220218 \ {1}, A335275 \ {1} and A337052 \ {1} at n = 56, and from A270428 \ {1} at n = 113.
Numbers k such that A051903(k) is a power of 2.
The asymptotic density of this sequence is 1/zeta(3) + Sum_{k>=2} (1/zeta(2^k+1) - 1/zeta(2^k)) = 0.87442038669659566330... .

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A000079, A002117, A051903.
Subsequences: A001146, A001248, A005117, A030514, A030635, A050376, A062503, A113849, A138302 \ {1}, A179645.
Similar sequences: A368714, A369937, A369939.
Cf. A096432, A220218, A270428, A335275, A337052.

pow2Q[n_] := n == 2^IntegerExponent[n, 2];
Select[Range[2, 100], pow2Q[Max[FactorInteger[#][[;; , 2]]]] &]
Select[Range[2,80],IntegerQ[Log2[Max[FactorInteger[#][[;;,2]]]]]&] (* Harvey P. Dale, Nov 06 2024 *)

ispow2(n) = n >> valuation(n, 2) == 1;
is(n) = n > 1 && ispow2(vecmax(factor(n)[, 2]));

A352780 Square array A(n,k), n >= 1, k >= 0, read by descending antidiagonals, such that the row product is n and column k contains only (2^k)-th powers of squarefree numbers.

Original entry on oeis.org

1, 1, 2, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 4, 5, 1, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 9, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 14

Offset: 1

Antti Karttunen and Peter Munn, Apr 02 2022

This is well-defined because positive integers have a unique factorization into powers of nonunit squarefree numbers with distinct exponents that are powers of 2.
Each (infinite) row is the lexicographically earliest with product n and terms that are a (2^k)-th power for all k.
For all k, column k is column k+1 of A060176 conjugated by A225546.

			The top left corner of the array:
  n/k |   0   1   2   3   4   5   6
------+------------------------------
    1 |   1,  1,  1,  1,  1,  1,  1,
    2 |   2,  1,  1,  1,  1,  1,  1,
    3 |   3,  1,  1,  1,  1,  1,  1,
    4 |   1,  4,  1,  1,  1,  1,  1,
    5 |   5,  1,  1,  1,  1,  1,  1,
    6 |   6,  1,  1,  1,  1,  1,  1,
    7 |   7,  1,  1,  1,  1,  1,  1,
    8 |   2,  4,  1,  1,  1,  1,  1,
    9 |   1,  9,  1,  1,  1,  1,  1,
   10 |  10,  1,  1,  1,  1,  1,  1,
   11 |  11,  1,  1,  1,  1,  1,  1,
   12 |   3,  4,  1,  1,  1,  1,  1,
   13 |  13,  1,  1,  1,  1,  1,  1,
   14 |  14,  1,  1,  1,  1,  1,  1,
   15 |  15,  1,  1,  1,  1,  1,  1,
   16 |   1,  1, 16,  1,  1,  1,  1,
   17 |  17,  1,  1,  1,  1,  1,  1,
   18 |   2,  9,  1,  1,  1,  1,  1,
   19 |  19,  1,  1,  1,  1,  1,  1,
   20 |   5,  4,  1,  1,  1,  1,  1,

Antti Karttunen, Table of n, a(n) for n = 1..33153; the first 257 antidiagonals

Sequences used in a formula defining this sequence: A000188, A007913, A060176, A225546.
Cf. A007913 (column 0), A335324 (column 1).
Range of values: {1} U A340682 (whole table), A005117 (column 0), A062503 (column 1), {1} U A113849 (column 2).
Row numbers of rows:
- with a 1 in column 0: A000290\{0};
- with a 1 in column 1: A252895;
- with a 1 in column 0, but not in column 1: A030140;
- where every 1 is followed by another 1: A337533;
- with 1's in all even columns: A366243;
- with 1's in all odd columns: A366242;
- where every term has an even number of distinct prime factors: A268390;
- where every term is a power of a prime: A268375;
- where the terms are pairwise coprime: A138302;
- where the last nonunit term is coprime to the earlier terms: A369938;
- where the last nonunit term is a power of 2: A335738.
Number of nonunit terms in row n is A331591(n); their positions are given (in reversed binary) by A267116(n); the first nonunit is in column A352080(n)-1 and the infinite run of 1's starts in column A299090(n).

up_to = 105;
A352780sq(n, k) = if(k==0, core(n), A352780sq(core(n, 1)[2], k-1)^2);
A352780list(up_to) = { my(v = vector(up_to), i=0); for(a=1,oo, forstep(col=a-1,0,-1, i++; if(i > up_to, return(v)); v[i] = A352780sq(a-col,col))); (v); };
v352780 = A352780list(up_to);
A352780(n) = v352780[n];

A(n,0) = A007913(n); for k > 0, A(n,k) = A(A000188(n), k-1)^2.
A(n,k) = A225546(A060176(A225546(n), k+1)).
A331591(A(n,k)) <= 1.

A361177 Exponentially powerful numbers: numbers whose exponents in their canonical prime factorization are all powerful numbers (A001694).

Original entry on oeis.org

1, 2, 3, 5, 6, 7, 10, 11, 13, 14, 15, 16, 17, 19, 21, 22, 23, 26, 29, 30, 31, 33, 34, 35, 37, 38, 39, 41, 42, 43, 46, 47, 48, 51, 53, 55, 57, 58, 59, 61, 62, 65, 66, 67, 69, 70, 71, 73, 74, 77, 78, 79, 80, 81, 82, 83, 85, 86, 87, 89, 91, 93, 94, 95, 97, 101, 102

Offset: 1

Amiram Eldar, Mar 03 2023

nonn

First differs from it subsequence A197680 at n = 167: a(167) = 256 is not a term of A197680.

The asymptotic density of this sequence is Product_{p prime} ((1 - 1/p)*(1 + Sum_{i>=1} 1/p^A001694(i))) = 0.6427901996... .

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A001694.

Similar sequences: A197680, A209061, A138302, A268335.

powQ[n_] := n == 1 || Min[FactorInteger[n][[;; , 2]]] > 1; Select[Range[100], AllTrue[FactorInteger[#][[;;, 2]], powQ] &]

ispow(n) = {n == 1 || vecmin(factor(n)[,2]) > 1; }
is(n) = {my(e = factor(n)[, 2]); if(n == 1, return(1)); for(i=1, #e, if(!ispow(e[i]), return(0))); 1;}

A372379 The largest divisor of n whose number of divisors is a power of 2.

Original entry on oeis.org

1, 2, 3, 2, 5, 6, 7, 8, 3, 10, 11, 6, 13, 14, 15, 8, 17, 6, 19, 10, 21, 22, 23, 24, 5, 26, 27, 14, 29, 30, 31, 8, 33, 34, 35, 6, 37, 38, 39, 40, 41, 42, 43, 22, 15, 46, 47, 24, 7, 10, 51, 26, 53, 54, 55, 56, 57, 58, 59, 30, 61, 62, 21, 8, 65, 66, 67, 34, 69, 70

Offset: 1

Amiram Eldar, Apr 29 2024

First differs from A350390 at n = 32.
The largest term of A036537 dividing n.
The largest divisor of n whose exponents in its prime factorization are all of the form 2^k-1 (A000225).

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A000225, A000523, A036537, A138302, A162643, A282940, A350390, A353897, A372380, A372381.

f[p_, e_] := p^(2^Floor[Log2[e + 1]] - 1); a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]

a(n) = {my(f = factor(n)); prod(i = 1, #f~, f[i, 1]^(2^exponent(f[i, 2]+1)-1));}

from math import prod
from sympy import factorint
def A372379(n): return prod(p**((1<<(e+1).bit_length()-1)-1) for p, e in factorint(n).items()) # Chai Wah Wu, Apr 30 2024

Multiplicative with a(p^e) = p^(2^floor(log_2(e+1)) - 1).
a(n) = n if and only if n is in A036537.
a(A162643(n)) = A282940(n).
Sum_{k=1..n} a(k) ~ c * n^2 / 2, where c = 0.7907361848... = Product_{p prime} (1 + Sum_{k>=1} (p^f(k) - p^(f(k-1)+1))/p^(2*k)), f(k) = 2^floor(log_2(k))-1 for k >= 1, and f(0) = 0.

A360902 Numbers with the same number of squarefree divisors and powerful divisors.

Original entry on oeis.org

1, 4, 9, 25, 36, 48, 49, 80, 100, 112, 121, 162, 169, 176, 196, 208, 225, 272, 289, 304, 361, 368, 405, 441, 464, 484, 496, 529, 567, 592, 656, 676, 688, 720, 752, 841, 848, 891, 900, 944, 961, 976, 1008, 1053, 1072, 1089, 1136, 1156, 1168, 1200, 1225, 1250, 1264

Offset: 1

Amiram Eldar, Feb 25 2023

nonn

Numbers k such that A034444(k) = A005361(k).
Numbers whose squarefree kernel (A007947) and powerful part (A057521) have the same number of divisors (A000005).
If k and m are coprime terms, then k*m is also a term.
All the terms are exponentially 2^n-numbers (A138302).
The characteristic function of this sequence depends only on prime signature.
Numbers whose canonical prime factorization has exponents whose geometric mean is 2.
Equivalently, numbers of the form Product_{i=1..m} p_i^(2^k_i), where p_i are distinct primes, and Sum_{i=1..m} k_i = m (i.e., the exponents k_i have an arithmetic mean 1).
1 is the only squarefree (A005117) term.
Includes the squares of squarefree numbers (A062503), which are the powerful (A001694) terms of this sequence.
The squares of primes (A001248) are the only terms that are prime powers (A246655).
Numbers of the for m*p^(2^k), where m is squarefree, p is prime, gcd(m, p) = 1 and omega(m) = k - 1, are all terms. In particular, this sequence includes numbers of the form p^4*q, where p != q are primes (A178739), and numbers of the form p^8*q*r where p, q, and r are distinct primes (A179747).
The corresponding numbers of squarefree (or powerful) divisors are 1, 2, 2, 2, 4, 4, 2, 4, 4, 4, 2, 4, ... . The least term with 2^k squarefree divisors is A360903(k).

			4 is a term since it has 2 squarefree divisors (1 and 2) and 2 powerful divisors (1 and 4).
36 is a term since it has 4 squarefree divisors (1, 2, 3 and 6) and 4 powerful divisors (1, 4, 9 and 36).

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A000005, A001694, A005117, A005361, A007947, A034444, A057521, A246655.
Subsequence of A138302.
Subsequences: A001248, A062503, A178739, A179747, A360903, A360904, A360905.

q[n_] := Module[{e = FactorInteger[n][[;; , 2]]}, Times @@ e == 2^Length[e]]; q[1] = True; Select[Range[1300], q]

is(k) = {my(e = factor(k)[,2]); prod(i = 1, #e, e[i]) == 2^#e; }

A361316 Numerators of the harmonic means of the infinitary divisors of the positive integers.

Original entry on oeis.org

1, 4, 3, 8, 5, 2, 7, 32, 9, 20, 11, 12, 13, 7, 5, 32, 17, 12, 19, 8, 21, 22, 23, 16, 25, 52, 27, 14, 29, 10, 31, 128, 11, 68, 35, 72, 37, 38, 39, 32, 41, 7, 43, 44, 3, 23, 47, 48, 49, 100, 17, 104, 53, 18, 55, 56, 57, 116, 59, 4, 61, 31, 63, 256, 65, 11, 67, 136

Offset: 1

Amiram Eldar, Mar 09 2023

			Fractions begin with 1, 4/3, 3/2, 8/5, 5/3, 2, 7/4, 32/15, 9/5, 20/9, 11/6, 12/5, ...

Amiram Eldar, Table of n, a(n) for n = 1..10000
Peter Hagis, Jr. and Graeme L. Cohen, Infinitary harmonic numbers, Bull. Australian Math. Soc., Vol. 41, No. 1 (1990), pp. 151-158.

Cf. A036537, A037445, A049417, A077609, A063947, A138302, A361317 (denominators).

Similar sequences: A099377, A103339.

f[p_, e_] := Module[{b = IntegerDigits[e, 2], m}, m = Length[b]; Product[If[b[[j]] > 0, 2/(1 + p^(2^(m - j))), 1], {j, 1, m}]]; a[1] = 1; a[n_] := Numerator[n * Times @@ f @@@ FactorInteger[n]]; Array[a, 100]

a(n) = {my(f = factor(n), b); numerator(n * prod(i=1, #f~, b = binary(f[i, 2]); prod(k=1, #b, if(b[k], 2/(f[i, 1]^(2^(#b-k))+1), 1)))); }

a(n) = numerator(n*A037445(n)/A049417(n)).
a(n)/A361317(n) <= A099377(n)/A099378(n), with equality if and only if n is in A036537.
a(n)/A361317(n) >= A103339(n)/A103340(n), with equality if and only if n is in A138302.

A363329 a(n) is the number of divisors of n that are both coreful and infinitary.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 3, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 3, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1

Offset: 1

Amiram Eldar, May 28 2023

For the definition of a coreful divisor see A307958, and for the definition of an infinitary divisor see A037445.
If e > 0 is the exponent of the highest power of p dividing n (where p is a prime), then for each divisor d of n that is both a coreful and an infinitary divisor, the exponent of the highest power of p dividing d is a number k >= 1 such that the bitwise AND of e and k is equal to k.
The least term that does not equal 1 or 3 is a(128) = 7.
The range of this sequence is A282572.

			a(8) = 3 since 8 has 4 divisors, 1, 2, 4 and 8, all are infinitary and 3 of them (2, 4 and 8) are also coreful.

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A000120, A005361 (number of coreful divisors), A007947, A037445, A077609, A138302, A282572, A359411.

f[p_, e_] := 2^DigitCount[e, 2, 1] - 1; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]

a(n) = factorback(apply(x -> 2^hammingweight(x) - 1, factor(n)[, 2]));

from math import prod
from sympy import factorint
def A363329(n): return prod((1<Chai Wah Wu, Sep 01 2023

Multiplicative with a(p^e) = 2^A000120(e) - 1.
a(n) = 1 is and only if n is in A138302.
a(n) >= A359411(n).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Product_{p prime} (-1/p + (1-1/p)*Product_{k>=0} (1 + 2/p^(2^k))) = 1.29926464312956239535... .

A365296 The smallest coreful infinitary divisor of n.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 2, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 6, 25, 26, 3, 28, 29, 30, 31, 2, 33, 34, 35, 36, 37, 38, 39, 10, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 6, 55, 14, 57, 58, 59, 60, 61, 62, 63, 4, 65, 66, 67, 68, 69

Offset: 1

Amiram Eldar, Aug 31 2023

A coreful divisor d of a number n is a divisor with the same set of distinct prime factors as n.
The number of coreful infinitary divisors of n is A363329(n).
All the terms are in A138302.

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A006519, A037445, A077609, A007947, A034444, A138302, A268335, A302792, A339597, A363329.

f[p_, e_] := p^(2^IntegerExponent[e, 2]); a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]

a(n) = {my(f = factor(n)); prod(i = 1, #f~, f[i,1]^(2^valuation(f[i,2], 2)));}

from math import prod
from sympy import factorint
def A365296(n): return prod(p**(e&-e) for p, e in factorint(n).items()) # Chai Wah Wu, Sep 01 2023

Multiplicative with a(p^e) = p^A006519(e).
a(n) = n if and only if n is in A138302.
a(n) >= A007947(n) with equality if and only if n is an exponentially odd number (A268335).
Sum_{k=1..n} a(k) ~ c * n^2, where c = (1/2) * Product_{p prime} (1 - 1/p + Sum_{e>=1} 1/p^f(e)-1/p^(f(e)+1)) = 0.4459084041..., where f(k) = 2*k - A006519(k) = A339597(k-1).
A037445(a(n)) = A034444(n). - Amiram Eldar, Oct 19 2023

A367169 a(n) is the sum of the exponents in the prime factorization of n that are powers of 2.

Original entry on oeis.org

0, 1, 1, 2, 1, 2, 1, 0, 2, 2, 1, 3, 1, 2, 2, 4, 1, 3, 1, 3, 2, 2, 1, 1, 2, 2, 0, 3, 1, 3, 1, 0, 2, 2, 2, 4, 1, 2, 2, 1, 1, 3, 1, 3, 3, 2, 1, 5, 2, 3, 2, 3, 1, 1, 2, 1, 2, 2, 1, 4, 1, 2, 3, 0, 2, 3, 1, 3, 2, 3, 1, 2, 1, 2, 3, 3, 2, 3, 1, 5, 4, 2, 1, 4, 2, 2, 2

Offset: 1

Amiram Eldar, Nov 07 2023

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A001222, A048298, A077761, A138302, A367168, A367170, A367171.

Similar sequences: A350386, A350387.

f[p_, e_] := If[e == 2^IntegerExponent[e, 2], e, 0]; a[1] = 0; a[n_] := Plus @@ f @@@ FactorInteger[n]; Array[a, 100]

a(n) = {my(f = factor(n)); sum(i = 1, #f~, if(f[i, 2] == 1 << valuation(f[i, 2], 2), f[i, 2], 0));}

from sympy import factorint
def A367169(n): return sum(e for e in factorint(n).values() if not(e&-e)^e) # Chai Wah Wu, Nov 10 2023

a(n) = A001222(A367168(n)).
Additive with a(p^e) = A048298(e).
a(n) <= A001222(n), with equality if and only if n is in A138302.
Sum_{k=1..n} a(k) ~ n * (log(log(n)) + B + C), where B is Mertens's constant (A077761) and C = -P(2) + Sum_{k>=1} 2^k * (P(2^k) - P(2^k+1)) = 0.28425245481079272416..., where P(s) is the prime zeta function.

cp's OEIS Frontend

A368979 The number of exponential divisors of n that are exponentially odd numbers (A268335).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A369938 Numbers whose maximal exponent in their prime factorization is a power of 2.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

A352780 Square array A(n,k), n >= 1, k >= 0, read by descending antidiagonals, such that the row product is n and column k contains only (2^k)-th powers of squarefree numbers.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Formula

A361177 Exponentially powerful numbers: numbers whose exponents in their canonical prime factorization are all powerful numbers (A001694).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

A372379 The largest divisor of n whose number of divisors is a power of 2.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Python

Formula

A360902 Numbers with the same number of squarefree divisors and powerful divisors.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A361316 Numerators of the harmonic means of the infinitary divisors of the positive integers.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A363329 a(n) is the number of divisors of n that are both coreful and infinitary.

Views

Author