Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A133945
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A133945 Sum phi(k), where the sum is over the integers k which are the "isolated divisors" of n, and phi(k) is the Euler totient function (phi(k) = A000010(k)). A positive divisor, k, of n is isolated if neither (k-1) nor (k+1) divides n. +0
2
1, 0, 3, 2, 5, 2, 7, 6, 9, 8, 11, 6, 13, 12, 15, 14, 17, 14, 19, 12, 21, 20, 23, 18, 25, 24, 27, 26, 29, 20, 31, 30, 33, 32, 35, 30, 37, 36, 39, 32, 41, 30, 43, 42, 45, 44, 47, 42, 49, 48, 51, 50, 53, 50, 55, 44, 57, 56, 59, 48, 61, 60, 63, 62, 65, 62, 67, 66, 69, 68, 71, 56, 73 (list; graph; listen)
OFFSET

1,3

COMMENT

Every divisor of an odd integer is an "isolated divisor."

a(2n+1) = 2n+1; a(2n) = 2n - A133946(n) .

MATHEMATICA

g[n_] := Block[{d = Divisors[n]}, Select[d, FreeQ[d, # - 1] && FreeQ[d, # + 1] &]]; Table[Plus @@ EulerPhi /@ g[n], {n, 100}] (*Chandler*)

CROSSREFS

Cf. A133946.

Sequence in context: A046524 A105222 A086571 this_sequence A124219 A103833 A046227

Adjacent sequences: A133942 A133943 A133944 this_sequence A133946 A133947 A133948

KEYWORD

nonn

AUTHOR

Leroy Quet (qq-quet(AT)mindspring.com), Sep 30 2007

EXTENSIONS

Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), May 28 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research