id:A046522 - OEIS Search Results

Search: id:A046522

Displaying 1-1 of 1 results found.

page 1

2[ sqrt(n) ]-d(n), where d(n) is number of divisors of n (A000005).

+0
2

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, 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, 12, 2, 12, 10, 8, 9, 12, 8, 14, 10, 12, 8, 14, 4, 14, 12, 10, 10, 12, 8, 14, 6, 13, 14 (list; graph; listen)

	OFFSET	`1,5`
	COMMENT	`Always >= 0.`
	REFERENCES	`D. S. Mitrinovic et al., Handbook of Number Theory, Kluwer, Section II.1.1.`
	MAPLE	`with(numtheory); f := n->2*floor(sqrt(n))-sigma[ 0 ](n);`
	CROSSREFS	`Sequence in context: A153585 A144494 A136166 this_sequence A112631 A158706 A096500` `Adjacent sequences: A046519 A046520 A046521 this_sequence A046523 A046524 A046525`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`

page 1

Search completed in 0.002 seconds

Last modified November 27 14:50 EST 2009. Contains 167570 sequences.

AT&T Labs Research