login
A393179
Number of k <= 2^(n-1) such that tau(k) = n where tau = A000005.
6
1, 1, 1, 2, 1, 5, 1, 16, 5, 13, 1, 211, 1, 35, 19, 3134, 1, 1577, 1, 8043, 46, 319, 1, 615620, 19, 1045, 1565, 383778, 1, 768107, 1, 167262047, 374, 12296, 83, 325122420, 1, 43460, 1167, 6200272135, 1, 409822597, 1, 1108940842, 352281, 564349, 1, 7832178297534
OFFSET
1,4
COMMENTS
For prime p, A000005(p^(n-1)) = n.
a(n) = 1 if n is noncomposite (A008578) and a(n) > 1 if n is composite (A002808).
LINKS
Daniel Suteu, Perl program
EXAMPLE
n \ k | a(n)
---------------------------------------------------------------------------------------
1 | 1 | 1
2 | 2 | 1
3 | 4 | 1
4 | 6, 8 | 2
5 | 16 | 1
6 | 12, 18, 20, 28, 32 | 5
7 | 64 | 1
8 | 24, 30, 40, 42, 54, 56, 66, 70, 78, 88, 102, 104, 105, 110, 114, 128 | 16
9 | 36, 100, 196, 225, 256 | 5
10 | 48, 80, 112, 162, 176, 208, 272, 304, 368, 405, 464, 496, 512 | 13
MATHEMATICA
d[k_] := d[k] = DivisorSigma[0, k]; a[n_] := Count[Range[2^(n - 1)], _?(d[#] == n &)]; Array[a, 20] (* Amiram Eldar, Mar 11 2026 *)
PROG
(Magma) [#[k: k in [1..2^(n - 1)] | #Divisors(k) eq n]: n in [1..23]];
(PARI) a(n) = #select(x->(numdiv(x)==n), [1..2^(n-1)]); \\ Michel Marcus, Mar 11 2026
(PARI) list(nmax) = {my(v = vector(nmax), n); for(k = 1, 2^(nmax-1), n = numdiv(k); if(n <= nmax && k <= (1 << (n-1)), v[n]++)); v; } \\ Amiram Eldar, Mar 11 2026
(Perl) # See Links section
CROSSREFS
KEYWORD
nonn
AUTHOR
EXTENSIONS
a(24)-a(26) from Michel Marcus, Mar 11 2026
a(27)-a(34) from Amiram Eldar, Mar 11 2026
a(35)-a(47) from Jinyuan Wang, Apr 05 2026
a(48) from Daniel Suteu, May 18 2026
STATUS
approved