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

 


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A318965 a(n) is the smallest number containing all its n prime factors in its decimal representation. 2
2, 135, 735, 21372, 271362, 4773132, 113678565, 11317129824, 131175822960, 7113719552940, 255360234137190, 12411792985131540
(list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
a(2) = 135 = 3^3 * 5,
a(3) = 735 = 3 * 5 * 7^2,
a(4) = 21372 = 2^2 * 3 * 13 * 137,
a(5) = 271362 = 2 * 3 * 7^2 * 13 * 71,
a(6) = 4773132 = 2^2 * 3^2 * 7 * 13 * 31 * 47.
a(7) = 113678565 = 3 * 5 * 7 * 11 * 13 * 67 * 113.
MATHEMATICA
a[n_] := Block[{k=1, s, f}, While[True, k++; If[Length[f = FactorInteger[k]] == n, s = ToString@k; If[AllTrue[First /@ f, StringPosition[s, ToString@ #] != {} &], Break[]]]]; k]; Array[a, 5]
CROSSREFS
Sequence in context: A014315 A221468 A327911 * A097641 A065963 A353012
KEYWORD
nonn,base,more
AUTHOR
Giovanni Resta, Sep 06 2018
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 19 05:53 EDT 2024. Contains 376004 sequences. (Running on oeis4.)