Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A064020
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A064020 Numbers n such that sf(n) = phi(n), where sf(n) = A013928(n). +0
1
2, 3, 9, 33, 363, 1089, 1653, 3237 (list; graph; listen)
OFFSET

1,1

COMMENT

No more terms < 30000. All terms, except the first, are multiples of 3. - Emeric Deutsch (deutsch(AT)duke.poly.edu), Jun 25 2005

EXAMPLE

sf(363)=220, phi(363)=220.

MAPLE

with(numtheory): a:=proc(n) if add(mobius(k)^2, k=1..n-1)=phi(n) then n else fi end: seq(a(n), n=1..5000); (Deutsch)

PROGRAM

(PARI) sf(n)=s=0; for(x=1, n, if(issquarefree(x), s++)); s; for(n=1, 10^5, if(sf(n)==eulerphi(n), print(n)))

CROSSREFS

Adjacent sequences: A064017 A064018 A064019 this_sequence A064021 A064022 A064023

Sequence in context: A006797 A139006 A073950 this_sequence A095412 A074428 A125052

KEYWORD

more,nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Sep 07 2001

EXTENSIONS

Corrected and extended by Emeric Deutsch (deutsch(AT)duke.poly.edu), Jun 25 2005

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 October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research