Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A106413
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A106413 Smallest number beginning with 3 that is the product of exactly n distinct primes. +0
1
3, 33, 30, 330, 3570, 30030, 3015870, 30120090, 300690390, 30043474230, 304075581810, 30035662366710, 304250263527210, 30078810535603830, 3001252188252588270, 32589158477190044730, 3003056284355533696290 (list; graph; listen)
OFFSET

1,1

EXAMPLE

a(1) = 3, a(6) = 30030 = 2*3*5*7*11*13.

CROSSREFS

Cf. A077326-A077334, A106411-A106419, A106421-A106429.

Sequence in context: A096469 A106423 A077328 this_sequence A101968 A103862 A084502

Adjacent sequences: A106410 A106411 A106412 this_sequence A106414 A106415 A106416

KEYWORD

base,nonn

AUTHOR

Ray Chandler (rayjchandler(AT)sbcglobal.net), May 02 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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research