Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A097456
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A097456
%S A097456 1,0,1,0,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,2,1,2,1,1,2,2,2,2,
%T A097456 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,
%U A097456 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,3,2,2,2,2,2,2
%N A097456 Integer part of the ratio (number of composites <=n) / (number of primes 
               <=n).
%F A097456 pi(n) = number of primes <= n. Ratio = (n - pi(n))/pi(n) = n/pi(n) - 
               1. Output floor(Ratio)
%o A097456 (PARI) compsp1(n) = { for(x=2,n, y=floor(x/pi(x)-1); print1(y",") ) }
%Y A097456 Sequence in context: A088569 A001285 A088424 this_sequence A164002 A087775 
               A089955
%Y A097456 Adjacent sequences: A097453 A097454 A097455 this_sequence A097457 A097458 
               A097459
%K A097456 nonn
%O A097456 2,26
%A A097456 Cino Hilliard (hillcino368(AT)gmail.com), Aug 23 2004

    
page 1

Search completed in 0.001 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 December 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research