id:A059958 - OEIS Search Results

Search: id:A059958

Displaying 1-1 of 1 results found.

page 1

Smallest number m such that m*(m+1) has n distinct prime factors.

+0
2

1, 2, 5, 14, 65, 209, 714, 7314, 38570, 254540, 728364, 11243154, 58524465, 812646120, 5163068910, 58720148850 (list; graph; listen)

	OFFSET	`1,2`
	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.` `Sequence in context: A008286 A049082 A158095 this_sequence A102019 A097595 A081483` `Adjacent sequences: A059955 A059956 A059957 this_sequence 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`

page 1

Search completed in 0.005 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.