login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070241 Card( k>0 : phi(k)=phi(n) ). 1
2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 2, 4, 5, 4, 5, 5, 5, 4, 4, 5, 6, 2, 2, 5, 5, 6, 4, 6, 2, 5, 2, 6, 5, 6, 10, 6, 6, 4, 10, 6, 7, 6, 4, 5, 10, 2, 2, 6, 4, 5, 7, 10, 2, 4, 9, 10, 8, 2, 2, 6, 7, 2, 8, 7, 10, 5, 2, 7, 3, 10, 2, 10, 12, 8, 9, 8, 9, 10, 2, 7, 2, 9, 2, 10, 8, 4, 3, 9, 5, 10, 17, 3, 9, 2, 17, 7 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

For many values of n (2,4,8,10,11,14,16,23,27,28,29,31,32...) a(n)=tau(n)

PROG

(PARI) for(n=1, 150, print1(sum(i=1, 3*n, if(eulerphi(n)-eulerphi(i), 0, 1)), ", "))

CROSSREFS

Sequence in context: A124831 A105096 A157790 * A066412 A196048 A176075

Adjacent sequences:  A070238 A070239 A070240 * A070242 A070243 A070244

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), May 09 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 05:53 EST 2012. Contains 205570 sequences.