Search: id:A070966 Results 1-1 of 1 results found. %I A070966 %S A070966 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, %T A070966 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, %U A070966 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 %N A070966 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. %H A070966 Leroy Quet, Home Page (listed in lieu of email address) %e A070966 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). %Y A070966 Sequence in context: A095165 A046805 A034880 this_sequence A072504 A072499 A060272 %Y A070966 Adjacent sequences: A070963 A070964 A070965 this_sequence A070967 A070968 A070969 %K A070966 nonn %O A070966 1,4 %A A070966 Leroy Quet, May 16 2002 Search completed in 0.001 seconds