login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A161659 a(n) = the smallest multiple of {the sum of the prime-factorization exponents of n} that is >= n. 1

%I

%S 2,3,4,5,6,7,9,10,10,11,12,13,14,16,16,17,18,19,21,22,22,23,24,26,26,

%T 27,30,29,30,31,35,34,34,36,36,37,38,40,40,41,42,43,45,45,46,47,50,50,

%U 51,52,54,53,56,56,56,58,58,59,60,61,62,63,66,66,66,67,69,70,72,71,75,73

%N a(n) = the smallest multiple of {the sum of the prime-factorization exponents of n} that is >= n.

%Y A161658

%K nonn

%O 2,1

%A Leroy Quet, Jun 15 2009

%E Corrected and extended by _Sean A. Irvine_, Apr 07 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified May 24 15:56 EDT 2013. Contains 225624 sequences.