|
|
A374459
|
|
Nonsquarefree exponentially odd numbers.
|
|
4
|
|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
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... .
|
|
LINKS
|
|
|
FORMULA
|
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.
|
|
EXAMPLE
|
8 = 2^3 is a term since 3 is odd and larger than 1.
|
|
MATHEMATICA
|
q[n_] := Module[{e = FactorInteger[n][[;; , 2]]}, AllTrue[e, OddQ] && ! AllTrue[e, # == 1 &]]; Select[Range[1000], q]
|
|
PROG
|
(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; }
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|