Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A087450
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A087450 Smallest number (see comment for representation) with all identical digits having n distinct prime divisors. +0
2
11, 12, 16, 26, 46, 61, 62, 121, 122, 182, 241, 242, 322, 301, 302, 422, 642, 646, 722, 1006, 601, 602, 842, 962, 1261, 1262, 1201, 1202, 2042, 1681, 1682, 1922, 1801, 1802, 2102, 2402, 2522, 3302, 3361, 3362, 3001, 3002 (list; graph; listen)
OFFSET

1,1

COMMENT

Sequence represented by citing the number of repeated digits concatenated with that digit, i.e. a(8) = 122.

No more terms < 3600. - David Wasserman (wasserma(AT)spawar.navy.mil), Jun 03 2005

EXAMPLE

a(6) = 86 because 66666666= 2*3*11*73*101*137, is 8 digits long and has 6 distinct prime divisors.

MATHEMATICA

PrimeFactors[n_Integer] := Flatten[Table[ #[[1]], {1}] & /@ FactorInteger[n]]; Do[k = 1; While[t = Table[j*(10^k - 1)/9, {j, 1, 9}]; l = Map[Length, Map[PrimeFactors, t]]; Position[l, n] == {}, k++ ]; d = t[[Position[l, n][[1, 1]]]]; Print[10k + Position[l, n][[1, 1]]], {n, 0, 17}]

CROSSREFS

Cf. A087331.

Adjacent sequences: A087447 A087448 A087449 this_sequence A087451 A087452 A087453

Sequence in context: A072239 A079350 A070605 this_sequence A046465 A134926 A105744

KEYWORD

base,nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Sep 06 2003

EXTENSIONS

More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Jun 03 2005

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 October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research