login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 4
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 (list; graph; refs; listen; history; text; internal format)
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
C. Rivera, Puzzle #201 The Arithmetic Function A(n) in "The Prime Puzzles and Problems Connection".
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
Sequence in context: A274009 A069157 A294894 * A351417 A226378 A347460
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 20:05 EDT 2024. Contains 371254 sequences. (Running on oeis4.)