|
|
A366538
|
|
The number of unitary divisors of the exponentially 2^n-numbers (A138302).
|
|
5
|
|
|
1, 2, 2, 2, 2, 4, 2, 2, 4, 2, 4, 2, 4, 4, 2, 2, 4, 2, 4, 4, 4, 2, 2, 4, 4, 2, 8, 2, 4, 4, 4, 4, 2, 4, 4, 2, 8, 2, 4, 4, 4, 2, 4, 2, 4, 4, 4, 2, 4, 4, 4, 2, 8, 2, 4, 4, 4, 8, 2, 4, 4, 8, 2, 2, 4, 4, 4, 4, 8, 2, 4, 2, 4, 2, 8, 4, 4, 4, 2, 8, 4, 4, 4, 4, 4, 2, 4
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Also, the number of infinitary divisors of the terms of A138302, since A138302 is also the sequence of numbers whose sets of unitary divisors (A077610) and infinitary divisors (A077609) coincide.
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
f[n_] := Module[{e = FactorInteger[n][[;; , 2]]}, If[AllTrue[e, # == 2^IntegerExponent[#, 2] &], 2^Length[e], Nothing]]; f[1] = 1; Array[f, 150]
|
|
PROG
|
(PARI) lista(max) = for(k = 1, max, my(e = factor(k)[, 2], is = 1); for(i = 1, #e, if(e[i] >> valuation(e[i], 2) > 1, is = 0; break)); if(is, print1(2^#e, ", ")));
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|