Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A088653
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A088653 Smallest prime whose product of digits is 3^n. +0
6
11, 3, 19, 139, 199, 1399, 1999, 13999, 99991, 139999, 199999, 1399999, 9999991, 19399999, 19999999, 919999939, 1399939999, 1999993999, 9199999999, 19399999999, 99999199999, 199999939999, 991999999999, 1999399999999 (list; graph; listen)
OFFSET

0,1

EXAMPLE

a(5) = 1399 and the digital product is 3^5.

MATHEMATICA

NextPrim[n_] := Block[{k = n + 1}, While[ ! PrimeQ[k], k++ ]; k]; a = Table[0, {18}]; p = 2; Do[q = Log[3, Times @@ IntegerDigits[p]]; If[q != 0 && IntegerQ[q] && a[[q]] == 0, a[[q]] = p; Print[q, " = ", p]]; p = NextPrim[p], {n, 1, 10^9}]

For a(23): a = Map[ FromDigits, Join[{0}, # ] & /@ Permutations[{1, 3, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9 }]]; Min[ Select[a, PrimeQ[ # ] & ]]

For a(11): a = Map[ FromDigits, Permutations[{2, 6, 8, 8, 8, 9, 9, 9, 9, 9}]]; Min[ Select[a, PrimeQ[ # ] & ]]

CROSSREFS

Cf. A089365, A090840, A091465, A090841, A089298.

Sequence in context: A110406 A110434 A110798 this_sequence A107598 A087100 A102380

Adjacent sequences: A088650 A088651 A088652 this_sequence A088654 A088655 A088656

KEYWORD

base,nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Nov 22 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research