|
| |
|
|
A071181
|
|
Number of k such that phi(k) divides phi(n).
|
|
0
| |
|
|
2, 2, 5, 5, 9, 5, 9, 9, 9, 9, 7, 9, 19, 9, 14, 14, 20, 9, 13, 14, 19, 7, 7, 14, 16, 19, 13, 19, 11, 14, 13, 20, 16, 20, 34, 19, 31, 13, 34, 20, 30, 19, 13, 16, 34, 7, 7, 20, 13, 16, 27, 34, 11, 13, 30, 34, 31, 11, 7, 20, 37, 13, 31, 27, 51, 16, 13, 27, 14, 34, 9, 34, 63, 31, 30, 31
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
PROG
| (PARI) for(n=1, 100, print1(sum(i=1, 1000, if(eulerphi(n)%eulerphi(i), 0, 1)), ", "))
|
|
|
CROSSREFS
| Sequence in context: A091609 A183563 A062405 * A171967 A079964 A184321
Adjacent sequences: A071178 A071179 A071180 * A071182 A071183 A071184
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 10 2002
|
| |
|
|
