The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A096220

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

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

#2 by Russ Cox at Sat Mar 31 14:11:24 EDT 2012

AUTHOR

_Ray G. Opao (1260(AT)email.com), _, Jul 29 2004

Discussion

Sat Mar 31

14:11

OEIS Server: https://oeis.org/edit/global/930

#1 by N. J. A. Sloane at Wed Sep 22 03:00:00 EDT 2004

NAME

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

DATA

1, 3, 6, 12, 20, 33, 48, 66, 87

OFFSET

0,2

LINKS

Carlos Rivera, <a href="http://www.primepuzzles.net/puzzles/puzz_172.htm">The Prime Puzzles & Problems Connection: Puzzle 172</a>.

EXAMPLE

a(7)=66: 1+1+1+1+1+1+1+1+2+3+5+7+11+13+17=66

KEYWORD

nonn

AUTHOR

Ray G. Opao (1260(AT)email.com), Jul 29 2004

STATUS

approved