A096220 - OEIS

This site is supported by donations to The OEIS Foundation.

A096220

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

1, 3, 6, 12, 20, 33, 48, 66, 87 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,2`
	LINKS	`Carlos Rivera, The Prime Puzzles & Problems Connection: Puzzle 172.`
	EXAMPLE	`a(7)=66: 1+1+1+1+1+1+1+1+2+3+5+7+11+13+17=66`
	CROSSREFS	`Sequence in context: A200067 A061061 A001975 * A034333 A182978 A006128` `Adjacent sequences: A096217 A096218 A096219 * A096221 A096222 A096223`
	KEYWORD	`nonn`
	AUTHOR	`Ray G. Opao (1260(AT)email.com), Jul 29 2004`

Content is available under The OEIS End-User License Agreement .

Last modified February 14 23:53 EST 2012. Contains 205689 sequences.