A318322 -id:A318322 - cp's OEIS frontend

A366989 The number of prime powers p^q dividing n, where p is prime and q is either 1 or prime (A334393 without the first term 1).

0, 1, 1, 2, 1, 2, 1, 3, 2, 2, 1, 3, 1, 2, 2, 3, 1, 3, 1, 3, 2, 2, 1, 4, 2, 2, 3, 3, 1, 3, 1, 4, 2, 2, 2, 4, 1, 2, 2, 4, 1, 3, 1, 3, 3, 2, 1, 4, 2, 3, 2, 3, 1, 4, 2, 4, 2, 2, 1, 4, 1, 2, 3, 4, 2, 3, 1, 3, 2, 3, 1, 5, 1, 2, 3, 3, 2, 3, 1, 4, 3, 2, 1, 4, 2, 2, 2

Offset: 1

Amiram Eldar, Oct 31 2023

First differs from A122810 at n = 48, and from A318322 at n = 64.

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A000720, A001221, A005117, A077761, A334393, A366988, A366991, A366992, A366994.

Cf. A122810, A318322.

f[p_, e_] := PrimePi[e] + 1; a[1] = 0; a[n_] := Plus @@ f @@@ FactorInteger[n]; Array[a, 100]

a(n) = {my(f = factor(n)); sum(i = 1, #f~, 1 + primepi(f[i, 2]));}

Additive with a(p^e) = A000720(e) + 1.
a(n) = 1 is and only if n is squarefree (A005117) > 1.
a(n) = A366988(n) + A001221(n).
Sum_{k=1..n} a(k) ~ n * (log(log(n)) + B + C), where B is Mertens's constant (A077761), C = Sum_{p prime} P(p) = 0.67167522222173297323..., and P(s) is the prime zeta function.

A318316 Multiplicative with a(p^e) = 2^A007306(e).

Original entry on oeis.org

1, 2, 2, 4, 2, 4, 2, 8, 4, 4, 2, 8, 2, 4, 4, 8, 2, 8, 2, 8, 4, 4, 2, 16, 4, 4, 8, 8, 2, 8, 2, 16, 4, 4, 4, 16, 2, 4, 4, 16, 2, 8, 2, 8, 8, 4, 2, 16, 4, 8, 4, 8, 2, 16, 4, 16, 4, 4, 2, 16, 2, 4, 8, 32, 4, 8, 2, 8, 4, 8, 2, 32, 2, 4, 8, 8, 4, 8, 2, 16, 8, 4, 2, 16, 4, 4, 4, 16, 2, 16, 4, 8, 4, 4, 4, 32, 2, 8, 8, 16, 2, 8, 2, 16, 8

Offset: 1

Antti Karttunen, Aug 31 2018

Antti Karttunen, Table of n, a(n) for n = 1..16384
Index entries for sequences computed from exponents in factorization of n

Cf. A007306, A318307, A318322.

A002487(n) = { my(a=1, b=0); while(n>0, if(bitand(n, 1), b+=a, a+=b); n>>=1); (b); }; \\ From A002487
A007306(n) = if(!n,1,A002487(n+n-1));
A318316(n) = factorback(apply(e -> 2^A007306(e),factor(n)[,2]));

from functools import reduce
from sympy import factorint
def A318316(n): return 1<Chai Wah Wu, May 18 2023

a(n) = 2^A318322(n).

a(n) = A318307(A003557(n^2)) = A318307(A003557(n))*A318307(n).

cp's OEIS Frontend

A366989 The number of prime powers p^q dividing n, where p is prime and q is either 1 or prime (A334393 without the first term 1).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula