A159237 Composite numbers A046346 divided by the sum of their prime factors (counted with multiplicity).

1, 2, 3, 3, 5, 5, 6, 6, 7, 10, 12, 11, 11, 15, 16, 11, 18, 14, 21, 20, 25, 17, 24, 30, 28, 32, 28, 27, 26, 19, 17, 36, 26, 28, 40, 23, 40, 26, 23, 45, 45, 48, 48, 40, 44, 54, 44, 34, 54, 29, 45, 48, 29, 54, 52, 44, 51, 31, 38, 65, 37, 29, 57, 52, 77, 78, 43, 43, 88, 69, 105, 105

Offset

1,2

Links

Zak Seidov, Table of n, a(n) for n=1..1000

Formula

a(n) = A046346(n)/sopfr(A046346(n)) = A046346(n)/A001414(A046346(n)).

Example

n=1: A046346(1)=4, A046346(4)=4, a(1)=4/4=1;
n=2: A046346(2)=16, A046346(16)=8, a(2)=16/8=2;
n=3: A046346(3)=27, A046346(27)=9, a(3)=27/9=3;
n=4: A046346(4)=30, A046346(30)=10, a(4)=30/10=3;
n=10: A046346(10)=150, A046346(150)=15, a(10)=150/15=10;
n=100: A046346(100)=3840, A046346(3840)=24, a(100)=3840/24=160;
n=1000: A046346(1000)=102860, A046346(102860)=185, a(1000)=102860/185=556.

Crossrefs

Cf. A046346 Composite numbers that are divisible by the sum of their prime factors (counted with multiplicity), A001414 Integer log of n: sum of primes dividing n (with repetition), sopfr(n), A036844 Numbers n such that n / sopfr(n) is an integer, where sopr() = sum-of-prime-factors, A001414.

Sequence in context: A330332 A023816 A353714 * A335599 A227065 A010761

Adjacent sequences: A159234 A159235 A159236 * A159238 A159239 A159240

Keyword

nonn

Author

Zak Seidov, Apr 06 2009

Status

approved