Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

1,1

EXAMPLE

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

CROSSREFS

Cf. A057600, A000959.

Sequence in context: A109285 A091760 A144525 this_sequence A046239 A093351 A018543

Adjacent sequences: A087670 A087671 A087672 this_sequence A087674 A087675 A087676

KEYWORD

nonn

AUTHOR

Vit Planocka (planocka(AT)mistral.cz), Sep 26 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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research