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

A335989 Terms of A301517 that are not exponentially odd numbers (A268335).

Original entry on oeis.org

12500, 18252, 21600, 37500, 50000, 67228, 84500, 87500, 91260, 127764, 137500, 146016, 150000, 151200, 162500, 200000, 200772, 201684, 212500, 231868, 237500, 237600, 253500, 262500, 268912, 274400, 280800, 287500, 310284, 336140, 337500, 346788, 350000, 362500
Offset: 1

Views

Author

Amiram Eldar, Jul 03 2020

Keywords

Comments

If k = Product p^e, then A162296(k) / A048250(k) = -1 + Product (p^(e+1) - 1)/(p^2 - 1). If k is exponentially odd, then e = 2*m - 1 is odd for all the prime factors p of k and p^(e+1) - 1 = (p^2)^m - 1 is divisible by p^2 - 1. Therefore, A162296(k) / A048250(k) is an integer for all exponentially odd numbers, and it is a positive integer for all the nonsquarefree (A013929) exponentially odd numbers.
It seems that most of the terms of A301517 are exponentially odd numbers. For example, the first 10^4 terms of A301517 include only 9 terms that are not exponentially odd numbers. Up to 10^8 there are 9660732 terms of A301517, and only 9107 of them are not exponentially odd numbers.
The number of terms of this sequence that do not exceed 10^k, for k = 5, 6, ... are 9, 92, 916, 9107, 91172, 911187, .... Apparently, this sequence has an asymptotic density c = 0.000091... If this is true, then the asymptotic density of A301517 is c + A065463 - A059956 = 0.096606... (A065463 is the density of the exponentially odd numbers, and A059956 is the density of the squarefree numbers which are a subset of the exponentially odd numbers).

Examples

			12500 = 2^2 * 5^5 is a term since the exponent of its prime factor 2 is 2 which even, and therefore it is not an exponentially odd number, and the sum of its squarefree divisors, A048250(12500) = 18 divides the sum of its nonsquarefree divisors, A162296(12500) = 27324 = 18 * 1518.
		

Crossrefs

Programs

  • Mathematica
    f[p_, e_] := (p^(e + 1) - 1)/(p^2 - 1); Select[Range[2, 4*10^5], Max[Last /@ (fct = FactorInteger[#])] > 1 && ! AllTrue[Last /@ fct, OddQ] && (r =  Times @@ (f @@@ fct)) > 1 && IntegerQ[r] &]

A374459 Nonsquarefree exponentially odd numbers.

Original entry on oeis.org

8, 24, 27, 32, 40, 54, 56, 88, 96, 104, 120, 125, 128, 135, 136, 152, 160, 168, 184, 189, 216, 224, 232, 243, 248, 250, 264, 270, 280, 296, 297, 312, 328, 343, 344, 351, 352, 375, 376, 378, 384, 408, 416, 424, 440, 456, 459, 472, 480, 486, 488, 512, 513, 520, 536
Offset: 1

Views

Author

Amiram Eldar, Jul 09 2024

Keywords

Comments

First differs from A301517 at n = 1213. A301517(1213) = 12500 = 2^2 * 5^5 is not an exponentially odd number.
Numbers whose exponents in their prime factorization are all odd and at least one of them is larger than 1.
All the squarefree numbers (A005117) are exponentially odd. Therefore, the sequence of exponentially odd numbers (A268335) is a disjoint union of the squarefree numbers and this sequence.
The asymptotic density of this sequence is A065463 - A059956 = 0.096515099145... .

Examples

			8 = 2^3 is a term since 3 is odd and larger than 1.
		

Crossrefs

Intersection of A013929 (or A046099) and A268335.
Subsequence of A301517.
Subsequences: A062838 \ {1}, A065036, A102838, A113850, A113852, A179671, A190011, A335988 \ {1}.

Programs

  • Mathematica
    q[n_] := Module[{e = FactorInteger[n][[;; , 2]]}, AllTrue[e, OddQ] && ! AllTrue[e, # == 1 &]]; Select[Range[1000], q]
  • PARI
    is(k) = {my(e = factor(k)[, 2]); for(i = 1, #e, if(!(e[i] %2), return(0))); for(i = 1, #e, if(e[i] >1, return(1))); 0;}

Formula

a(n) = A268335(A374460(n)).
Sum_{n>=1} 1/a(n)^s = zeta(2*s) * (Product_{p prime} (1 + 1/p^s - 1/p^(2*s))) - zeta(s)/zeta(2*s) for s > 1.

A381312 Numbers whose powerful part (A057521) is a power of a prime with an odd exponent >= 3 (A056824).

Original entry on oeis.org

8, 24, 27, 32, 40, 54, 56, 88, 96, 104, 120, 125, 128, 135, 136, 152, 160, 168, 184, 189, 224, 232, 243, 248, 250, 264, 270, 280, 296, 297, 312, 328, 343, 344, 351, 352, 375, 376, 378, 384, 408, 416, 424, 440, 456, 459, 472, 480, 486, 488, 512, 513, 520, 536, 544
Offset: 1

Views

Author

Amiram Eldar, Feb 19 2025

Keywords

Comments

Subsequence of A301517 and A374459 and first differs from them at n = 21. A301517(21) = A374459(21) = 216 is not a term of this sequence.
Numbers having exactly one non-unitary prime factor and its multiplicity is odd.
Numbers whose prime signature (A118914) is of the form {1, 1, ..., 2*m+1} with m >= 1, i.e., any number (including zero) of 1's and then a single odd number > 1.
The asymptotic density of this sequence is (1/zeta(2)) * Sum_{p prime} 1/((p-1)*(p+1)^2) = 0.093382464285953613312...

Crossrefs

Programs

  • Mathematica
    q[n_] := Module[{e = ReverseSort[FactorInteger[n][[;; , 2]]]}, e[[1]] > 1 && OddQ[e[[1]]] && (Length[e] == 1 || e[[2]] == 1)]; Select[Range[1000], q]
  • PARI
    isok(k) = if(k == 1, 0, my(e = vecsort(factor(k)[, 2], , 4)); e[1] % 2 && e[1] > 1 && (#e == 1 || e[2] == 1));

A362594 Exponentially odd numbers that are neither squarefree nor prime powers.

Original entry on oeis.org

24, 40, 54, 56, 88, 96, 104, 120, 135, 136, 152, 160, 168, 184, 189, 216, 224, 232, 248, 250, 264, 270, 280, 296, 297, 312, 328, 344, 351, 352, 375, 376, 378, 384, 408, 416, 424, 440, 456, 459, 472, 480, 486, 488, 513, 520, 536, 544, 552, 568, 584, 594, 608, 616
Offset: 1

Views

Author

Michael De Vlieger, Sep 08 2023

Keywords

Comments

The asymptotic density of this sequence is A065463 - A059956 = 0.09651509914... . - Amiram Eldar, Sep 27 2023

Examples

			24 = 2^3 * 3^1 is in this sequence because it has 2 distinct prime factors whose multiplicities are odd and one such multiplicity exceeds 1.
		

Crossrefs

Programs

  • Mathematica
    Select[Select[Range[1000], Nor[SquareFreeQ[#], PrimePowerQ[#]] &], Times @@ FactorInteger[#][[All, 1]] == (Sqrt[#] /. (c_ : 1)*a_^(b_ : 0) :> (c*a^b)^2) &]

Formula

This sequence is A126706 INTERSECT A268335.
A268335 = Union(S, T) where S is this sequence and T = {A005117 U A097054} = {A005117 U A246551}.

A384520 Numbers whose powerful part (A057521) is greater than 1 and is equal to a squarefree number raised to an odd power (A384518).

Original entry on oeis.org

8, 24, 27, 32, 40, 54, 56, 88, 96, 104, 120, 125, 128, 135, 136, 152, 160, 168, 184, 189, 216, 224, 232, 243, 248, 250, 264, 270, 280, 296, 297, 312, 328, 343, 344, 351, 352, 375, 376, 378, 384, 408, 416, 424, 440, 456, 459, 472, 480, 486, 488, 512, 513, 520, 536
Offset: 1

Views

Author

Amiram Eldar, Jun 01 2025

Keywords

Comments

Subsequence of A301517 and A374459 and first differs from them at n = 85: A374459(85) = A374459(85) = 864 = 2^5 * 3^3 is not a term of this sequence.
First differs from its subsequence A381312 at n = 21: a(21) = 216 = 2^3 * 3^3 is not a term of A381312.
Numbers whose prime factorization has one distinct exponent that is larger than 1 and it is odd.
Numbers that are a product of a squarefree number (A005117) and a coprime nonsquarefree number that is a squarefree number raised to an odd power (A384518).
The asymptotic density of this sequence is Sum_{k>=1} (d(2*k+1)-1)/zeta(2) = 0.095609588748823080455..., where d(k) = (zeta(2*k)/zeta(k)) * Product_{p prime} (1 + 2/p^k + Sum_{i=k+1..2*k-1} (-1)^(i+1)/p^i).

Crossrefs

Intersection of A268335 and A375142.
Intersection of A295661 and A375142.
Intersection of A376142 and A375142.
Equals A375142 \ A384519.
Subsequence of A301517 and A374459.
Subsequences: A381312, A384518.

Programs

  • Mathematica
    q[n_] := Module[{u = Union[Select[FactorInteger[n][[;; , 2]], # > 1 &]]}, Length[u] == 1 && OddQ[u[[1]]]]; Select[Range[250], q]
  • PARI
    isok(k) = {my(e = select(x -> (x > 1), Set(factor(k)[, 2]))); #e == 1 && e[1] % 2;}
Showing 1-5 of 5 results.