Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A046522
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A046522
%S A046522 1,0,0,1,2,0,2,0,3,2,4,0,4,2,2,3,6,2,6,2,4,4,6,0,7,6,6,4,8,2,8,
%T A046522 4,6,6,6,3,10,8,8,4,10,4,10,6,6,8,10,2,11,8,10,8,12,6,10,6,10,10,
%U A046522 12,2,12,10,8,9,12,8,14,10,12,8,14,4,14,12,10,10,12,8,14,6,13,14
%N A046522 2[ sqrt(n) ]-d(n), where d(n) is number of divisors of n (A000005).
%C A046522 Always >= 0.
%D A046522 D. S. Mitrinovic et al., Handbook of Number Theory, Kluwer, Section II.1.1.
%p A046522 with(numtheory); f := n->2*floor(sqrt(n))-sigma[ 0 ](n);
%Y A046522 Sequence in context: A153585 A144494 A136166 this_sequence A112631 A158706 
               A096500
%Y A046522 Adjacent sequences: A046519 A046520 A046521 this_sequence A046523 A046524 
               A046525
%K A046522 nonn
%O A046522 1,5
%A A046522 N. J. A. Sloane (njas(AT)research.att.com).

    
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 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research