Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096221
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A096221
%S A096221 1,2,3,5,7,10,13,15,18
%N A096221 a(n) is the number of distances used by prime-complete rules of minimal 
               length for the first n primes.
%H A096221 Carlos Rivera, <a href="http://www.primepuzzles.net/puzzles/puzz_172.htm">
               The Prime Puzzles & Problems Connection: Puzzle 172</a>.
%e A096221 a(7)=15: there are 7 primes (2, 3, 5, 7, 11, 13, 17) and 8 ones.
%Y A096221 Sequence in context: A117952 A162999 A064509 this_sequence A120367 A072831 
               A072388
%Y A096221 Adjacent sequences: A096218 A096219 A096220 this_sequence A096222 A096223 
               A096224
%K A096221 nonn
%O A096221 0,2
%A A096221 Ray G. Opao (1260(AT)email.com), Jul 29 2004

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research