id:A096221 - OEIS Search Results

Search: id:A096221

Displaying 1-1 of 1 results found.

page 1

a(n) is the number of distances used by prime-complete rules of minimal length for the first n primes.

+0
1

1, 2, 3, 5, 7, 10, 13, 15, 18 (list; graph; listen)

	OFFSET	`0,2`
	LINKS	`Carlos Rivera, The Prime Puzzles & Problems Connection: Puzzle 172.`
	EXAMPLE	`a(7)=15: there are 7 primes (2, 3, 5, 7, 11, 13, 17) and 8 ones.`
	CROSSREFS	`Sequence in context: A117952 A162999 A064509 this_sequence A120367 A072831 A072388` `Adjacent sequences: A096218 A096219 A096220 this_sequence A096222 A096223 A096224`
	KEYWORD	`nonn`
	AUTHOR	`Ray G. Opao (1260(AT)email.com), Jul 29 2004`

page 1

Search completed in 0.002 seconds

Last modified December 16 17:18 EST 2009. Contains 170825 sequences.