id:A069513 - OEIS Search Results

Search: id:A069513

Displaying 1-1 of 1 results found.

page 1

Sum(d divides n,bigomega(d)*mu(n/d)).

+0
1

0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`If n>=2, a(n)=A010055(n).`
	FORMULA	`Dirichlet generating function: ppzeta(s). Here ppzeta(s) = sum_{p prime} sum_{k=1}^{infinity} 1/(p^)k^s. Note that ppzeta(s) = sum_{p prime} 1/(p^s-1) and ppzeta(s) = sum_{k=1}^{infinity} primezeta(k*s). - Franklin T. Adams-Watters, Sep 11 2005.`
	PROGRAM	`(PARI) for(n=1, 120, print1(sumdiv(n, d, bigomega(d)*moebius(n/d)), ", "))`
	CROSSREFS	`Cf. A001222.` `Sequence in context: A131719 A100656 A053867 this_sequence A092248 A106743 A011558` `Adjacent sequences: A069510 A069511 A069512 this_sequence A069514 A069515 A069516`
	KEYWORD	`easy,nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 15 2002`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research