Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A057600
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A057600 a(n) is smallest number m such that (m = product of n distinct primes) and all divisors of m are lucky numbers. +0
2
3, 21, 777, 61383 (list; graph; listen)
OFFSET

1,1

COMMENT

a(5)>2*10^7, if it exists. - Vit Planocka (planocka(AT)mistral.cz), Sep 26 2003

EXAMPLE

E.g. a(2) = 3*7 = 21: divisors of 21 are 1, 3, 7, 21, all of which are lucky numbers.

MATHEMATICA

lst = Range[1, 2*10^7, 2]; i = 2; While[ i <= (len = Length@lst) && (k = lst[[i]]) <= len, lst = Drop[lst, {k, len, k}]; i++ ]; fQ[n_] := Block[{d = Rest@Divisors@n, k = 1, lmt = DivisorSigma[0, n]}, While[k < lmt && MemberQ[lst, d[[k]]], k++ ]; k == lmt]; t = Table[0, {10}]; Do[ If[ fQ@lst[[n]], a = Length@ FactorInteger@lst[[n]]; If[ t[[a]] == 0, t[[a]] = lst[[n]]; Print[ lst[[n]] ]]], {n, 2, Length@lst}] (from Robert G. Wilson v (rgwv(at)rgwv.com), May 12 2006)

CROSSREFS

Cf. A000959.

Sequence in context: A098918 A001699 A162924 this_sequence A079269 A127104 A144621

Adjacent sequences: A057597 A057598 A057599 this_sequence A057601 A057602 A057603

KEYWORD

more,nonn

AUTHOR

Naohiro Nomoto (6284968128(AT)geocities.co.jp), Oct 06 2000

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 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research