A161658 - OEIS

This site is supported by donations to The OEIS Foundation.

A161658

a(n) = the largest multiple of {the sum of the prime-factorization exponents of n} that is <= n.

0, 2, 3, 4, 5, 6, 7, 6, 8, 10, 11, 12, 13, 14, 14, 16, 17, 18, 19, 18, 20, 22, 23, 24, 24, 26, 27, 27, 29, 30, 31, 30, 32, 34, 34, 36, 37, 38, 38, 40, 41, 42, 43, 42, 45, 46, 47, 45, 48, 48, 50, 51, 53, 52, 54, 56, 56, 58, 59, 60, 61, 62, 63, 60, 64, 66, 67, 66, 68, 69, 71, 70, 73, 74, 75, 75, 76, 78 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,2`
	FORMULA	`a(n) = n - (n mod A001222(n)), n>=1. - R. J. Mathar, Jul 08 2011`
	MAPLE	`A161658 := proc(n) if n = 1 then 0; else e := numtheory[bigomega](n) ; n - (n mod e) ; end if; end proc: # R. J. Mathar, Jul 08 2011`
	CROSSREFS	`Cf. A161659` `Sequence in context: A000026 A005599 A071934 * A066853 A141258 A117656` `Adjacent sequences: A161655 A161656 A161657 * A161659 A161660 A161661`
	KEYWORD	`nonn`
	AUTHOR	`Leroy Quet, Jun 15 2009`

Content is available under The OEIS End-User License Agreement .

Last modified February 17 04:58 EST 2012. Contains 205985 sequences.