id:A073819 - OEIS Search Results

Search: id:A073819

Displaying 1-1 of 1 results found.

page 1

a(n) = prime(i) such that prime(i)*(n+1-i) is maximized (1 <= i <= n).

+0
3

2, 2, 2, 5, 5, 11, 11, 11, 11, 17, 17, 17, 17, 29, 29, 29, 29, 29, 37, 37, 37, 41, 41, 41, 41, 59, 59, 59, 59, 59, 59, 59, 67, 67, 67, 71, 71, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 127, 127, 127, 127, 127, 127, 127, 127, 149, 149, 149, 149, 149, 149, 149, 149 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`3 is the only n for which the maximum is not unique; a(3) could also be given as 3.`
	FORMULA	`a(n) = A073818(n)/A073820(n).`
	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) = 5.`
	CROSSREFS	`Cf. A073818, A073820.` `Sequence in context: A020917 A035643 A096403 this_sequence A066835 A123953 A097006` `Adjacent sequences: A073816 A073817 A073818 this_sequence A073820 A073821 A073822`
	KEYWORD	`easy,nonn`
	AUTHOR	`David Wasserman (wasserma(AT)spawar.navy.mil), Aug 13 2002`

page 1

Search completed in 0.002 seconds

Last modified September 6 16:04 EDT 2008. Contains 143483 sequences.

AT&T Labs Research