A325943 a(n) = floor(n / omega(n)) where omega = A001221.

2, 3, 4, 5, 3, 7, 8, 9, 5, 11, 6, 13, 7, 7, 16, 17, 9, 19, 10, 10, 11, 23, 12, 25, 13, 27, 14, 29, 10, 31, 32, 16, 17, 17, 18, 37, 19, 19, 20, 41, 14, 43, 22, 22, 23, 47, 24, 49, 25, 25, 26, 53, 27, 27, 28, 28, 29, 59, 20, 61, 31, 31, 64, 32, 22, 67, 34, 34, 23

Offset

2,1

Links

Hauke Löffler, Table of n, a(n) for n = 2..10001

Example

a(2) = 2; 2 has one distinct prime divisor {2}, so a(2) = floor(2/1) = 2.
a(10) = 5; 10 has two distinct prime divisors {2,5}, so a(10) = floor(10/2) = 5.
a(15) = 7; 15 has two distinct prime divisors {3,5}, so a(15) = floor(15/2) = 7.

Prog

(SageMath)
[ n // (len(prime_divisors(n))) for n in range(2, 20) ]

Crossrefs

Sequence in context: A376664 A217434 A322035 * A295126 A235602 A304180

Adjacent sequences: A325940 A325941 A325942 * A325944 A325945 A325946

Keyword

nonn

Author

Hauke Löffler, Sep 09 2019

Status

approved