A076526 a(n) = r * max(e_1, ..., e_r), where n = p_1^e_1 . .... p_r^e_r is the canonical prime factorization of n, a(1) = 0.

0, 1, 1, 2, 1, 2, 1, 3, 2, 2, 1, 4, 1, 2, 2, 4, 1, 4, 1, 4, 2, 2, 1, 6, 2, 2, 3, 4, 1, 3, 1, 5, 2, 2, 2, 4, 1, 2, 2, 6, 1, 3, 1, 4, 4, 2, 1, 8, 2, 4, 2, 4, 1, 6, 2, 6, 2, 2, 1, 6, 1, 2, 4, 6, 2, 3, 1, 4, 2, 3, 1, 6, 1, 2, 4, 4, 2, 3, 1, 8, 4, 2, 1, 6, 2, 2, 2, 6, 1, 6, 2, 4, 2, 2, 2, 10, 1, 4, 4, 4, 1, 3, 1, 6, 3

Offset

1,4

Comments

Introduced by Luis Flavio Soares Nunes - see link. Omega(n) <= a(n) for n > 1, where Omega(n) = the number of prime factors of n, counting multiplicity, A001222.

Links

Antti Karttunen, Table of n, a(n) for n = 1..10000

C. Rivera, Puzzle #201 The Arithmetic Function A(n) in "The Prime Puzzles and Problems Connection".

Index entries for sequences computed from exponents in factorization of n

Formula

a(n) = A001221(n) * A051903(n). - Antti Karttunen, May 28 2017

Mathematica

a[n_] := Module[{pf}, pf = Transpose[FactorInteger[n]]; Length[pf[[1]]]*Max[pf[[2]]]]; Table[a[i], {i, 2, 100}]

Crossrefs

Cf. A001221, A001222, A051903, A076558, A076745.

Sequence in context: A274009 A069157 A294894 * A351417 A226378 A347460

Adjacent sequences: A076523 A076524 A076525 * A076527 A076528 A076529

Keyword

easy,nonn

Author

Joseph L. Pe, Nov 10 2002

Extensions

a(1)=0 prepended and more terms added by Antti Karttunen, May 28 2017

Status

approved