id:A070966 - OEIS Search Results

Search: id:A070966

Displaying 1-1 of 1 results found.

page 1

Sum{k|n, k<=sqrt(n)} phi(k); where the sum is over the positive divisors, k, of n, which are <= the squareroot of n; and phi(k) is the Euler totient function.

+0
1

1, 1, 1, 2, 1, 2, 1, 2, 3, 2, 1, 4, 1, 2, 3, 4, 1, 4, 1, 4, 3, 2, 1, 6, 5, 2, 3, 4, 1, 8, 1, 4, 3, 2, 5, 8, 1, 2, 3, 8, 1, 6, 1, 4, 7, 2, 1, 8, 7, 6, 3, 4, 1, 6, 5, 10, 3, 2, 1, 12, 1, 2, 9, 8, 5, 6, 1, 4, 3, 12, 1, 12, 1, 2, 7, 4, 7, 6, 1, 12, 9, 2, 1, 14, 5, 2, 3, 8, 1, 16, 7, 4, 3, 2, 5, 12, 1, 8, 9, 12 (list; graph; listen)

	OFFSET	`1,4`
	EXAMPLE	`a(30) = phi(1) + phi(2) + phi(3) + phi(5) = 1 + 1 + 2 + 4 = 8 because 1, 2, 3 and 5 are the positive divisors of 30 which are <= sqrt(30).`
	CROSSREFS	`Sequence in context: A095165 A046805 A034880 this_sequence A072504 A072499 A060272` `Adjacent sequences: A070963 A070964 A070965 this_sequence A070967 A070968 A070969`
	KEYWORD	`nonn`
	AUTHOR	`Leroy Quet (qq-quet(AT)mindspring.com), May 16 2002`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research