id:A069359 - OEIS Search Results

Search: id:A069359

Displaying 1-1 of 1 results found.

page 1

a(1)=0; for n>1, a(n)=n*sum(p|n,1/p) where p are primes dividing n.

+0
2

0, 1, 1, 2, 1, 5, 1, 4, 3, 7, 1, 10, 1, 9, 8, 8, 1, 15, 1, 14, 10, 13, 1, 20, 5, 15, 9, 18, 1, 31, 1, 16, 14, 19, 12, 30, 1, 21, 16, 28, 1, 41, 1, 26, 24, 25, 1, 40, 7, 35, 20, 30, 1, 45, 16, 36, 22, 31, 1, 62, 1, 33, 30, 32, 18, 61, 1, 38, 26, 59, 1, 60, 1, 39, 40, 42, 18, 71, 1, 56 (list; graph; listen)

	OFFSET	`1,4`
	COMMENT	`Also arithmetic derivative of square-free numbers: a(A005117(n)) = A068328(n) = A003415(A005117(n)). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 20 2003`
	FORMULA	`G.f.: Sum(x^p(j)/(1-x^p(j))^2,j=1..infinity), where p(j) is the j-th prime. - Vladeta Jovovic (vladeta(AT)eunet.rs), Mar 29 2006`
	CROSSREFS	`Sequence in context: A055205 A161686 A069626 this_sequence A014652 A060448 A090080` `Adjacent sequences: A069356 A069357 A069358 this_sequence A069360 A069361 A069362`
	KEYWORD	`easy,nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 15 2002`

page 1

Search completed in 0.002 seconds

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.

AT&T Labs Research