|
Search: id:A053578
|
|
| |
|
| 1, 1, 2, 1, 4, 1, 4, 1, 8, 1, 8, 8, 1, 1, 1, 16, 16, 1, 1, 16, 1, 1, 1, 1, 32, 1, 32, 1, 1, 32, 32, 1, 1, 1, 1, 1, 1, 64, 1, 1, 1, 1, 1, 64, 1, 64, 1, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 128, 1, 1, 1, 1, 1, 128, 1, 1, 1, 1, 1, 128, 1, 128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
Except for 2^0=1, there are only finitely many values of k such that cototient(k) = 2^m for fixed m.
|
|
EXAMPLE
|
For p prime, cototient[p]=1. Smallest values for which cototient[x]=2^w are 6,12,24,96,192,..,49152 for w=2,3,4,5,6,...,15
|
|
CROSSREFS
|
Cf. A051953, A053577.
Sequence in context: A079276 A126210 A040005 this_sequence A029205 A072721 A035092
Adjacent sequences: A053575 A053576 A053577 this_sequence A053579 A053580 A053581
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Jan 18 2000
|
|
|
Search completed in 0.002 seconds
|
