Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067929
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A067929 Numbers n such that n divides the alternating sum phi(1)-phi(2)+phi(3)-phi(4)+...+((-1)^(n+1))phi(n). +0
2
1, 2, 4, 12, 17, 55, 57, 80, 195, 211, 233, 602, 694, 1319, 2726, 26312, 71173, 101457, 145789, 165710, 299228, 483888, 718738, 1757846, 4206121, 9518456 (list; graph; listen)
OFFSET

1,2

COMMENT

phi(1)-phi(2)+phi(3)-phi(4) = 1-1+2-2 = 0, which is divisible by 4, so 4 is a term of the sequence.

MATHEMATICA

s = 0; Do[s = s + (-1)^(i + 1) * EulerPhi[i]; If[ Mod[s, i] == 0, Print[i]], {i, 1, 10^7}]

PROGRAM

(PARI) {a067929(m)=local(s, n); s=0; for(n=1, m, if(n%2==0, s=s-eulerphi(n), s=s+eulerphi(n)); if(s%n==0, print1(n, ", ")))}

CROSSREFS

Cf. A000010, A068773.

Sequence in context: A097001 A085931 A125885 this_sequence A064361 A064407 A052289

Adjacent sequences: A067926 A067927 A067928 this_sequence A067930 A067931 A067932

KEYWORD

nonn

AUTHOR

Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Feb 22 2002

EXTENSIONS

Edited and extended by Robert G. Wilson v (rgwv(AT)rgwv.com) and Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Feb 27 2002

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 6 17:22 EDT 2008. Contains 140988 sequences.


AT&T Labs Research