id:A076526 - OEIS Search Results

Search: id:A076526

Displaying 1-1 of 1 results found.

page 1

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.

+0
3

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 (list; graph; listen)

	OFFSET	`2,3`
	COMMENT	`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.`
	LINKS	`C. Rivera, Puzzle #201 The Arithmetic Function A(n) in "The Prime Puzzles and Problems Connection".`
	MATHEMATICA	`a[n_] := Module[{pf}, pf = Transpose[FactorInteger[n]]; Length[pf[[1]]]*Max[pf[[2]]]]; Table[a[i], {i, 2, 100}]`
	CROSSREFS	`Cf. A076558, A076745.` `Sequence in context: A056692 A039637 A069157 this_sequence A033273 A034836 A001055` `Adjacent sequences: A076523 A076524 A076525 this_sequence A076527 A076528 A076529`
	KEYWORD	`easy,nonn`
	AUTHOR	`Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Nov 10 2002`

page 1

Search completed in 0.002 seconds

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.

AT&T Labs Research