

A162961


If the prime factorization of n is n=product{pn} p^b(n,p), then a(n) = the smallest positive integer such that each p^b(n,p) divides a different integer k where a(n) <= k <= a(n)+{number distinct prime divisors of n}1. a(1)=1.


0



1, 2, 3, 4, 5, 2, 7, 8, 9, 4, 11, 3, 13, 6, 5, 16, 17, 8, 19, 4, 6, 10, 23, 8, 25, 12, 27, 7, 29, 3
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

Clarification of definition: Each b(n,p) is a positive integer. Let the number of distinct primes dividing n be P. There is a permutation (c(1),c(2),c(3),...c(P)) of the p^b(n,p)'s such that c(1)a(n), c(2)(a(n)+1), c(3)(a(n)+2),..., c(P)(a(n)+P1).


LINKS

Table of n, a(n) for n=1..30.


EXAMPLE

3150 is factored as 2^1 * 3^2 * 5^2 * 7^1. a(3150) = 25, which can be seen from 5^225, 2^126, 3^227, and 7^128.


CROSSREFS

Sequence in context: A028233 A216972 A066296 * A145255 A053626 A134364
Adjacent sequences: A162958 A162959 A162960 * A162962 A162963 A162964


KEYWORD

more,nonn


AUTHOR

Leroy Quet, Jul 19 2009


STATUS

approved



