login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A059958 Smallest number m such that m*(m+1) has n distinct prime factors. 2
1, 2, 5, 14, 65, 209, 714, 7314, 38570, 254540, 728364, 11243154, 58524465, 812646120, 5163068910, 58720148850, 555409903685 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

a(18) <= 5702759516090. - Donovan Johnson, Oct 05 2011

FORMULA

a(n)=Min{m|A001221(m*(m+1))=n}

EXAMPLE

n=9, a(n)=38570 since n(n+1)=(2.5.7.19.29)(3.13.23.43) a(n)<=A002110(n)-1 because A001221[(q-1)q]>=n+1.

CROSSREFS

Cf. A006549, A001221, A002110, A054989, A083002.

Sequence in context: A008286 A049082 A158095 * A102019 A097595 A081483

Adjacent sequences:  A059955 A059956 A059957 * A059959 A059960 A059961

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Mar 02 2001

EXTENSIONS

More terms from William Rex Marshall (w.r.marshall(AT)actrix.co.nz), Mar 18 2001

Offset corrected and a(15)-a(16) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Jan 31 2009

a(17) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Sep 15 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 10:52 EST 2012. Contains 205763 sequences.