(Translated by https://www.hiragana.jp/)

login

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

 

Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!) A340033 a(n) is the largest number of distinct numbers whose product is A025487(n). 1 1, 2, 2, 3, 3, 3, 3, 4, 4, 3, 4, 4, 4, 4, 4, 4, 5, 4, 5, 5, 5, 5, 5, 5, 4, 5, 5, 5, 5, 5, 5, 4, 5, 6, 5, 6, 5, 5, 6, 5, 6, 6, 6, 6, 6, 5, 6, 6, 6, 6, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 6, 6, 6, 7, 6, 6, 7, 6, 6, 7, 7, 6, 7, 7, 6, 6, 5, 7, 6, 7, 7, 7, 7, 7, 6 (list; graph; refs; listen; history; text; internal format) OFFSET 1,2 LINKS David A. Corneth, Table of n, a(n) for n = 1..10000 EXAMPLE a(11) = 4 as A025487(11) = 36, which can be expressed as a product of at most 4 distinct positive integers via 1 * 2 * 3 * 6. CROSSREFS Cf. A025487, A338160. Sequence in context: A097747 A285717 A115777 * A316847 A072768 A071673 Adjacent sequences: A340030 A340031 A340032 * A340034 A340035 A340036 KEYWORD nonn AUTHOR David A. Corneth, Feb 04 2021 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 August 26 17:36 EDT 2024. Contains 375462 sequences. (Running on oeis4.)