id:A073818 - OEIS Search Results

Search: id:A073818

Displaying 1-1 of 1 results found.

page 1

a(n) = max(prime(i)*(n+1-i) | 1 <= i <= n).

+0
5

2, 4, 6, 10, 15, 22, 33, 44, 55, 68, 85, 102, 119, 145, 174, 203, 232, 261, 296, 333, 370, 410, 451, 492, 533, 590, 649, 708, 767, 826, 885, 944, 1005, 1072, 1139, 1207, 1278, 1358, 1455, 1552, 1649, 1746, 1843, 1940, 2037, 2134, 2231, 2328, 2425, 2540, 2667 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`Smallest m such that m! is divisible by product_{k=0..n} A002110(k).`
	EXAMPLE	`For n = 5, we take the first 5 primes in ascending order and multiply them by the numbers from 5 to 1 in descending order: 25 = 10 34 = 12 53 = 15 72 = 14 11*1 = 11 The largest product is 15, so a(5) = 15.`
	CROSSREFS	`Cf. A073819, A073820.` `Sequence in context: A073470 A086182 A035294 this_sequence A143184 A116084 A108925` `Adjacent sequences: A073815 A073816 A073817 this_sequence A073819 A073820 A073821`
	KEYWORD	`easy,nonn`
	AUTHOR	`David Wasserman (wasserma(AT)spawar.navy.mil), Aug 13 2002`
	EXTENSIONS	`Thanks to Naohiro Nomoto (n_nomoto(AT)yabumi.com) for correcting an editing error, Jun 01 2003`

page 1

Search completed in 0.002 seconds

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.

AT&T Labs Research