id:A074796 - OEIS Search Results

Search: id:A074796

Displaying 1-1 of 1 results found.

page 1

Number of numbers k <=n such that tau(k) == 2 (mod 3) where tau(k) =A00005(k) is the number of divisors of k.

+0
1

0, 1, 2, 2, 3, 3, 4, 4, 4, 4, 5, 5, 6, 6, 6, 7, 8, 8, 9, 9, 9, 9, 10, 11, 11, 11, 11, 11, 12, 13, 14, 14, 14, 14, 14, 14, 15, 15, 15, 16, 17, 18, 19, 19, 19, 19, 20, 20, 20, 20, 20, 20, 21, 22, 22, 23, 23, 23, 24, 24, 25, 25, 25, 25, 25, 26, 27, 27, 27, 28, 29, 29, 30, 30, 30, 30 (list; graph; listen)

	OFFSET	`1,3`
	FORMULA	`a(n) is asymptotic to c*n with c=0.38.....`
	PROGRAM	`(PARI) a(n)=sum(k=1, n, if(numdiv(k)%3-2, 0, 1))`
	CROSSREFS	`Sequence in context: A139789 A000720 A070549 this_sequence A061070 A117695 A074794` `Adjacent sequences: A074793 A074794 A074795 this_sequence A074797 A074798 A074799`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 07 2002`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research