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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A318871 Minimum Heinz number of a factorization of n into factors > 1. 18
 1, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 35, 41, 43, 47, 49, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS The Heinz number of an integer partition (y_1, ..., y_k) is prime(y_1) * ... * prime(y_k). LINKS MAPLE a:= proc(n) option remember; `if`(n=1, 1, min(ithprime(n), seq(ithprime(d)*a(n/d), d=numtheory[divisors](n) minus {1, n}))) end: seq(a(n), n=1..60); # Alois P. Heinz, Sep 05 2018 MATHEMATICA facs[n_]:=If[n<=1, {{}}, Join@@Table[(Prepend[#1, d]&)/@Select[facs[n/d], Min@@#1>=d&], {d, Rest[Divisors[n]]}]]; Table[Min[Times@@Prime/@#&/@facs[n]], {n, 100}] CROSSREFS Cf. A000040, A001055, A007716, A056239, A064988, A162247, A215366, A246868. Sequence in context: A242393 A210494 A338483 * A330225 A275938 A093893 Adjacent sequences: A318868 A318869 A318870 * A318872 A318873 A318874 KEYWORD nonn AUTHOR Gus Wiseman, Sep 05 2018 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.

Last modified December 4 20:32 EST 2022. Contains 358570 sequences. (Running on oeis4.)