|
| |
|
|
A053287
|
|
Euler totient function (A000010) of 2^n-1.
|
|
8
| |
|
|
1, 2, 6, 8, 30, 36, 126, 128, 432, 600, 1936, 1728, 8190, 10584, 27000, 32768, 131070, 139968, 524286, 480000, 1778112, 2640704, 8210080, 6635520, 32400000, 44717400, 113467392, 132765696, 533826432, 534600000, 2147483646
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| Number of elements of multiplicative order 2^n-1 in GF(2^n).
a(A000079(n-1)) = A058891(n).
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n=1..100
|
|
|
FORMULA
| a(n)=A000010[A000225(n)]
a[n]=A000010[2^n-1] or also a[n]=A062401(2^(n-1))=phi[sigma[2^(n-1)]. - Labos E. (labos(AT)ana.sote.hu), Jul 19 2004
|
|
|
MAPLE
| with(numtheory):with(combinat):a:=n->phi(stirling2(n, 2)): seq(a(n), n=2..32); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Oct 05 2007
|
|
|
MATHEMATICA
| Table[EulerPhi[DivisorSigma[1, 2^w]], {w, 0, 25}] Table[EulerPhi[2^w-1], {w, 1, 25}]
|
|
|
PROG
| (PARI) a(n) = eulerphi(2^n-1) [From Michael Porter (michael_b_porter(AT)yahoo.com), Oct 06 2009]
|
|
|
CROSSREFS
| Cf. A000010, A000225, A051953, A057764.
Sequence in context: A056188 A020696 A132269 * A086323 A075999 A096999
Adjacent sequences: A053284 A053285 A053286 * A053288 A053289 A053290
|
|
|
KEYWORD
| nonn,easy,nice
|
|
|
AUTHOR
| Labos E. (labos(AT)ana.sote.hu), Mar 03 2000
|
| |
|
|
