A096219 - OEIS

This site is supported by donations to The OEIS Foundation.

A096219

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

1, 1, 1, 1, 3, 7, 41, 2, 18 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,5`
	LINKS	`Carlos Rivera, The Prime Puzzles & Problems Connection: Puzzle 172.`
	EXAMPLE	`a(7)=2: 1.1.1.1.11.1.1.2.13.7.17.1.3.5.1 and 1.1.1.1.11.2.1.1.13.7.17.1.5.3.1.`
	CROSSREFS	`Sequence in context: A018943 A019024 A135071 * A128647 A071730 A058815` `Adjacent sequences: A096216 A096217 A096218 * A096220 A096221 A096222`
	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 16 21:51 EST 2012. Contains 205978 sequences.