id:A049613 - OEIS Search Results

Search: id:A049613

Displaying 1-1 of 1 results found.

page 1

a(n) = 2n - (largest prime < 2n-2).

+0
6

3, 3, 3, 5, 3, 3, 5, 3, 3, 5, 3, 5, 7, 3, 3, 5, 7, 3, 5, 3, 3, 5, 3, 5, 7, 3, 5, 7, 3, 3, 5, 7, 3, 5, 3, 3, 5, 7, 3, 5, 3, 5, 7, 3, 5, 7, 9, 3, 5, 3, 3, 5, 3, 3, 5, 3, 5, 7, 9, 11, 13, 15, 3, 5, 3, 5, 7, 3, 3, 5, 7, 9, 11, 3, 3, 5, 7, 3, 5, 7, 3, 5, 3, 5, 7, 3, 5, 7, 3, 3, 5 (list; graph; listen)

	OFFSET	`3,1`
	LINKS	`T. D. Noe, Table of n, a(n) for n=3..10000`
	FORMULA	`a(n) <= A002373(n). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Mar 19 2008`
	EXAMPLE	`a(14)=28 - (largest prime < 26) = 28 - 23 = 5.`
	CROSSREFS	`Cf. A049653, A049711, A049716, A049847.` `Sequence in context: A123371 A011277 A084742 this_sequence A002373 A103153 A096918` `Adjacent sequences: A049610 A049611 A049612 this_sequence A049614 A049615 A049616`
	KEYWORD	`nice,nonn,easy`
	AUTHOR	`David M. Elder (elddm(AT)rhodes.edu)`

page 1

Search completed in 0.003 seconds

Last modified July 8 18:40 EDT 2008. Contains 141013 sequences.

AT&T Labs Research