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-8 of 8 results.

A366901 The number of exponentially odious divisors of n.

Original entry on oeis.org

1, 2, 2, 3, 2, 4, 2, 3, 3, 4, 2, 6, 2, 4, 4, 4, 2, 6, 2, 6, 4, 4, 2, 6, 3, 4, 3, 6, 2, 8, 2, 4, 4, 4, 4, 9, 2, 4, 4, 6, 2, 8, 2, 6, 6, 4, 2, 8, 3, 6, 4, 6, 2, 6, 4, 6, 4, 4, 2, 12, 2, 4, 6, 4, 4, 8, 2, 6, 4, 8, 2, 9, 2, 4, 6, 6, 4, 8, 2, 8, 4, 4, 2, 12, 4, 4, 4
Offset: 1

Views

Author

Amiram Eldar, Oct 27 2023

Keywords

Comments

First differs from A049599 and A282446 at n = 32, from A365551 at n = 64, and from A353898 at n = 128.
The number of divisors of n that are exponentially odious numbers (A270428), i.e., numbers having only odious (A000069) exponents in their canonical prime factorization.
The sum of these divisors is A366903(n) and the largest of them is A366905(n).

Crossrefs

Programs

  • Mathematica
    f[p_, e_] := Floor[e/2] + If[OddQ[e] || EvenQ[DigitCount[e + 1, 2, 1]], 1, 0] + 1; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]
  • PARI
    s(n) = 1 + n\2 + (n%2 || hammingweight(n+1)%2==0); \\ after Charles R Greathouse IV at A115384
    a(n) = vecprod(apply(x -> s(x), factor(n)[, 2]));

Formula

Multiplicative with a(p^e) = A115384(e) + 1.
a(n) <= A000005(n), with equality if and only if n is a cubefree number (A004709).

A367516 The number of unitary divisors of n that are exponentially evil numbers (A262675).

Original entry on oeis.org

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

Views

Author

Amiram Eldar, Nov 21 2023

Keywords

Comments

First differs from A359411 at n = 128.

Crossrefs

Programs

  • Mathematica
    f[p_, e_] := If[EvenQ[DigitCount[e, 2, 1]], 2, 1]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]
  • PARI
    a(n) = vecprod(apply(x -> 2-hammingweight(x)%2, factor(n)[, 2]));
    
  • Python
    from sympy import factorint
    def A367516(n): return 1<Chai Wah Wu, Nov 23 2023

Formula

Multiplicative with a(p^e) = (2-A010060(e)).
a(n) = A034444(n)/A367515(n).
a(n) = 2^A367512(n).
a(n) >= 1, with equality if and only if n is an exponentially odious number (A270428).
a(n) <= A034444(n), with equality if and only if n is an exponentially evil number (A262675).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Product_{p prime} f(1/p) = 1.13071730542774788785..., where f(x) = 1/2 + x + ((1-x)/2) * Product_{k>=0} (1 - x^(2^k)).

A366906 The largest exponentially evil divisor of n.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 8, 1, 1, 1, 1, 1, 1, 1, 8, 1, 1, 1, 1, 1, 1, 1, 8, 1, 1, 27, 1, 1, 1, 1, 32, 1, 1, 1, 1, 1, 1, 1, 8, 1, 1, 1, 1, 1, 1, 1, 8, 1, 1, 1, 1, 1, 27, 1, 8, 1, 1, 1, 1, 1, 1, 1, 64, 1, 1, 1, 1, 1, 1, 1, 8, 1, 1, 1, 1, 1, 1, 1, 8, 27, 1, 1, 1, 1, 1
Offset: 1

Views

Author

Amiram Eldar, Oct 27 2023

Keywords

Comments

The largest divisor of n that is an exponentially evil number (A262675).
The number of exponentially evil divisors of n is A366902(n) and their sum is A366904(n).

Crossrefs

Similar sequences: A353897, A365683, A366905.

Programs

  • Mathematica
    maxEvil[e_] := Module[{k = e}, While[OddQ[DigitCount[k, 2, 1]], k--]; k]; f[p_, e_] := p^maxEvil[e]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]
  • PARI
    s(n) = {my(k = n); while(hammingweight(k)%2, k--); k;}
    a(n) = {my(f = factor(n)); prod(i = 1, #f~, f[i, 1]^s(f[i, 2]));}

Formula

Multiplicative with a(p^e) = p^max{k=1..e, k evil}.
a(n) <= n, with equality if and only if n is exponentially evil number (A262675).
a(n) >= 1, with equality if and only if n is a cubefree number (A004709).

A366904 The sum of exponentially evil divisors of n.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 28, 1, 1, 1, 1, 41, 1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 28, 1, 9, 1, 1, 1, 1, 1, 1, 1, 105, 1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 1, 1, 9, 28, 1, 1, 1, 1
Offset: 1

Views

Author

Amiram Eldar, Oct 27 2023

Keywords

Comments

The number of these divisors is A366902(n) and the largest of them is A366906(n).

Crossrefs

Similar sequences: A353900, A365682, A366903.

Programs

  • Mathematica
    f[p_, e_] := 1 + Total[p^Select[Range[e], EvenQ[DigitCount[#, 2, 1]] &]]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]
  • PARI
    a(n) = {my(f = factor(n)); prod(i = 1, #f~, 1 + sum(k = 1, f[i, 2], !(hammingweight(k)%2) * f[i, 1]^k));}

Formula

Multiplicative with a(p^e) = 1 + Sum_{k = 1..e, k is evil} p^k.
a(n) >= 1, with equality if and only if n is a cubefree number (A004709).

A367513 The exponentially evil part of n: the largest unitary divisor of n that is an exponentially evil number (A262675).

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 8, 1, 1, 27, 1, 1, 1, 1, 32, 1, 1, 1, 1, 1, 1, 1, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 27, 1, 8, 1, 1, 1, 1, 1, 1, 1, 64, 1, 1, 1, 1, 1, 1, 1, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
Offset: 1

Views

Author

Amiram Eldar, Nov 21 2023

Keywords

Crossrefs

Programs

  • Mathematica
    f[p_, e_] := p^(e * (1 - ThueMorse[e])); a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]
  • PARI
    a(n) = {my(f = factor(n)); prod(i = 1, #f~, if(hammingweight(f[i, 2])%2, 1, f[i, 1]^f[i, 2]));}
    
  • Python
    from math import prod
    from sympy import factorint
    def A367513(n): return prod(p**e for p, e in factorint(n).items() if e.bit_count()&1^1) # Chai Wah Wu, Nov 23 2023

Formula

Multiplicative with a(p^e) = p^(e*A010059(e)) = p^A102391(e).
a(n) = n/A367514(n).
A001221(a(n)) = A367512(n).
A034444(a(n)) = A367516(n).
a(n) >= 1, with equality if and only if n is an exponentially odious number (A270428).
a(n) <= n, with equality if and only if n is an exponentially evil number (A262675).

A367515 The number of unitary divisors of n that are exponentially odious numbers (A270428).

Original entry on oeis.org

1, 2, 2, 2, 2, 4, 2, 1, 2, 4, 2, 4, 2, 4, 4, 2, 2, 4, 2, 4, 4, 4, 2, 2, 2, 4, 1, 4, 2, 8, 2, 1, 4, 4, 4, 4, 2, 4, 4, 2, 2, 8, 2, 4, 4, 4, 2, 4, 2, 4, 4, 4, 2, 2, 4, 2, 4, 4, 2, 8, 2, 4, 4, 1, 4, 8, 2, 4, 4, 8, 2, 2, 2, 4, 4, 4, 4, 8, 2, 4, 2, 4, 2, 8, 4, 4, 4
Offset: 1

Views

Author

Amiram Eldar, Nov 21 2023

Keywords

Crossrefs

Programs

  • Mathematica
    f[p_, e_] := If[OddQ[DigitCount[e, 2, 1]], 2, 1]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]
  • PARI
    a(n) = vecprod(apply(x -> hammingweight(x)%2+1, factor(n)[, 2]));
    
  • Python
    from sympy import factorint
    def A367515(n): return 1<Chai Wah Wu, Nov 23 2023

Formula

Multiplicative with a(p^e) = A001285(e).
a(n) = A034444(n)/A367516(n).
a(n) = 2^A293439(n).
a(n) >= 1, with equality if and only if n is an exponentially evil number (A262675).
a(n) <= A034444(n), with equality if and only if n is an exponentially odious number (A270428).

A367803 Exponentially evil squares.

Original entry on oeis.org

1, 64, 729, 1024, 4096, 15625, 46656, 59049, 117649, 262144, 531441, 746496, 1000000, 1048576, 1771561, 2985984, 3779136, 4826809, 7529536, 9765625, 11390625, 16000000, 16777216, 24137569, 34012224, 47045881, 60466176, 64000000, 85766121, 113379904, 120472576, 148035889
Offset: 1

Views

Author

Amiram Eldar, Dec 01 2023

Keywords

Comments

Numbers whose prime factorization contains only exponents that are even evil numbers (A125592).
Also, squares of exponentially evil numbers (A262675).
Also, numbers with an equal number of exponentially odious and exponentially evil divisors, i.e., numbers k such that A366901(k) = A366902(k). - Amiram Eldar, Feb 26 2024

Crossrefs

Intersection of A000290 and A262675.

Programs

  • Mathematica
    evilQ[n_] := EvenQ[DigitCount[n, 2, 1]]; Select[Range[10^4]^2, #== 1 || AllTrue[FactorInteger[#][[;;, 2]], evilQ] &]
  • PARI
    isexpevil(n) = {my(f = factor(n)); for (i = 1, #f~, if(hammingweight(f[i, 2])%2, return (0))); 1;}
    is(n) = issquare(n) && isexpevil(n);

Formula

a(n) = A262675(n)^2.
Sum_{n>=1} 1/a(n) = Product_{p prime} (1 + Sum_{k>=1} 1/p^A125592(k)) = Product_{p prime} f(1/p) = 1.01833932269003592136..., where f(x) = (2/(1-x^2) + Product_{k>=0} (1 - x^(2^k)) + Product_{k>=0} (1 - (-x)^(2^k)))/4.

A375359 The maximum exponent in the prime factorization of the smallest number whose square is divisible by n.

Original entry on oeis.org

0, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 2, 1
Offset: 1

Views

Author

Amiram Eldar, Aug 13 2024

Keywords

Comments

Differs from A050361 at n = 1, 64, 128, 192, ... . Differs from A366902 at n = 1, 64, 192, 216, ... . Differs from A325837 at n = 1, 216, 432, 648, ... .

Crossrefs

Programs

  • Mathematica
    a[n_] := Module[{e = FactorInteger[n][[;; , 2]]}, Max[(If[EvenQ[#], #, # + 1]) & /@ e]/2]; a[1] = 0; Array[a, 100]
  • PARI
    a(n) = if(n == 1, 0, vecmax(apply(x -> if(x % 2, x+1, x), factor(n)[,2]))/2);

Formula

a(n) = A051903(A019554(n)).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = 1 + Sum{k>=1} (1 - 1/zeta(2*k+1)) = 1.21464720975357037829... .
Showing 1-8 of 8 results.