

A279513


Multiplicative with a(p^k) = p*a(k) for any prime p and k>0.


1



1, 2, 3, 4, 5, 6, 7, 6, 6, 10, 11, 12, 13, 14, 15, 8, 17, 12, 19, 20, 21, 22, 23, 18, 10, 26, 9, 28, 29, 30, 31, 10, 33, 34, 35, 24, 37, 38, 39, 30, 41, 42, 43, 44, 30, 46, 47, 24, 14, 20, 51, 52, 53, 18, 55, 42, 57, 58, 59, 60, 61, 62, 42, 12, 65, 66, 67, 68
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

To compute a(n): multiply (with multiplicity) each prime number appearing in the prime tower factorization of n (see A182318 for definition).
a(n) = n if n is squarefree.
a(n) <= A000026(n) for any n>0.
First differs from A000026 at n=256: a(256)=12 and A000026(256)=16.
If n=p_1 * p_2 * ... * p_k with p_1, p_2, ..., p_k primes, then a(p_1 ^ p_2 ^ ... ^ p_k) = n.


LINKS

Rémy Sigrist, Table of n, a(n) for n = 1..10000


EXAMPLE

a(6!) = a(2^(2^2)*3^2*5) = 2*2*2*3*2*5 = 240.


PROG

(PARI) a(n) = my (f=factor(n)); return (prod(i=1, #f~, f[i, 1]*a(f[i, 2])))


CROSSREFS

Cf. A000026, A182318, A279510.
Sequence in context: A017872 A206495 A161209 * A000026 A005599 A071934
Adjacent sequences: A279510 A279511 A279512 * A279514 A279515 A279516


KEYWORD

nonn,mult


AUTHOR

Rémy Sigrist, Dec 13 2016


STATUS

approved



