A053576 -id:A053576 - cp's OEIS frontend

A078168 Numbers k such that phi(k) is a perfect 8th power.

1, 2, 257, 512, 514, 544, 640, 680, 768, 816, 960, 1020, 65537, 131072, 131074, 131584, 139264, 139808, 163840, 164480, 174080, 174760, 196608, 197376, 208896, 209712, 245760, 246720, 261120, 262140, 1682227, 1683109, 1683559, 1683937

Offset: 1

Labos Elemer, Nov 27 2002

nonn

			phi of the sequence includes 1, 256, 65536, 1679616, etc.; powers arise several times; a(3) = A053576(7) = 257; in sequence smoother ranges and quite large jumps arise when power of new numbers appear as phi-values.

Amiram Eldar, Table of n, a(n) for n = 1..7500

Cf. A039770 (square), A039771 (cube), A078164 (4th), A078165 (5th), A078166 (6th), A078167 (7th), A078168 (8th, this sequence), A078169 (9th), A078170 (10th power), A001317, A053576, A045544, A000010.

k=8; Do[s=EulerPhi[n]^(1/k); If[IntegerQ[s], Print[n]], {n, 1, 10000000}]
Select[Range[2*10^6],IntegerQ[Surd[EulerPhi[#],8]]&] (* Harvey P. Dale, Oct 20 2014 *)

is(n)=ispower(eulerphi(n),8) \\ Charles R Greathouse IV, Apr 24 2020

A078169 Numbers k such that phi(k) is a perfect 9th power.

Original entry on oeis.org

1, 2, 771, 1024, 1028, 1088, 1280, 1360, 1536, 1542, 1632, 1920, 2040, 327685, 524288, 524296, 526336, 557056, 559232, 655360, 655370, 657920, 696320, 699040, 786432, 786444, 789504, 835584, 838848, 983040, 986880, 1044480, 1048560

Offset: 1

Labos Elemer, Nov 27 2002

nonn

			phi of the sequence includes 1, 512, 262144,.. etc.; powers arise several times; a(3) = A053576(9) = 771; in sequence smoother ranges and quite large jumps arise when power of new numbers appear as phi-values.

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A039770 (square), A039771 (cube), A078164 (4th), A078165 (5th), A078166 (6th), A078167 (7th), A078168 (8th), A078169 (9th, this sequence), A078170 (10th power), A001317, A053576, A045544, A000010.

k=9; Do[s=EulerPhi[n]^(1/k); If[IntegerQ[s], Print[n]], {n, 1, 10000000}]

is(n)=ispower(eulerphi(n),9) \\ Charles R Greathouse IV, Apr 24 2020

A078170 Numbers k such that phi(k) is a perfect tenth power.

Original entry on oeis.org

1, 2, 1285, 2048, 2056, 2176, 2560, 2570, 2720, 3072, 3084, 3264, 3840, 4080, 1114129, 2097152, 2097184, 2105344, 2228224, 2228258, 2236928, 2621440, 2621480, 2631680, 2785280, 2796160, 3145728, 3145776, 3158016, 3342336

Offset: 1

Labos Elemer, Nov 27 2002

nonn

			phi of the sequence includes 1, 1024, 1048576,.. etc.; powers emerge several times; a(3) = A053576(10) = 1285; in sequence smoother ranges and quite large jumps alternate when power of new numbers appear as phi-values.

Amiram Eldar, Table of n, a(n) for n = 1..2250

Cf. A039770 (square), A039771 (cube), A078164 (4th), A078165 (5th), A078166 (6th), A078167 (7th), A078168 (8th), A078169 (9th), A078170 (10th power, this sequence), A001317, A053576, A045544, A000010.

k=10; Do[s=EulerPhi[n]^(1/k); If[IntegerQ[s], Print[n]], {n, 1, 10000000}]

is(n)=ispower(eulerphi(n),10) \\ Charles R Greathouse IV, Apr 24 2020

A293231 a(n) = Product_{d|n, dA019565(A193231(d)).

Original entry on oeis.org

1, 2, 2, 12, 2, 36, 2, 120, 6, 60, 2, 5400, 2, 360, 30, 25200, 2, 56700, 2, 21000, 180, 840, 2, 23814000, 10, 504, 630, 50400, 2, 661500, 2, 554400, 420, 132, 300, 392931000, 2, 792, 252, 242550000, 2, 24948000, 2, 2772000, 22050, 1980, 2, 605113740000, 60, 4851000, 66, 3880800, 2, 720373500, 700, 4889808000, 396, 2772, 2, 588305025000, 2, 1848

Offset: 1

Antti Karttunen, Oct 03 2017

Antti Karttunen, Table of n, a(n) for n = 1..1024
Index entries for sequences related to binary expansion of n

Cf. A019565, A193231, A290090, A293214, A293232 (rgs-version of this sequence).

Cf. also A001317, A045544, A053576.

A019565(n) = {my(j,v); factorback(Mat(vector(if(n, #n=vecextract(binary(n), "-1..1")), j, [prime(j), n[j]])~))}; \\ This function from M. F. Hasler
A193231(n) = { my(x='x); subst(lift(Mod(1, 2)*subst(Pol(binary(n), x), x, 1+x)), x, 2) }; \\ This function from Franklin T. Adams-Watters
A293231(n) = { my(m=1); fordiv(n,d,if(d < n,m *= A019565(A193231(d)))); m; };

a(n) = Product_{d|n, dA019565(A193231(d)).
For all n >= 1, A007814(a(n)) = A290090(n).
For n = 0..5, a(A001317((2^n)-1)) = A002110((2^n)-1).

A058213 Triangular arrangement of solutions of phi(x) = 2^n (n >= 0), where phi=A000010 is Euler's totient function. Each row corresponds to a particular n and its length is n+2 for 0 <= n <= 31, 32 for n >= 32. (This assumes that there are only 5 Fermat primes.)

Original entry on oeis.org

1, 2, 3, 4, 6, 5, 8, 10, 12, 15, 16, 20, 24, 30, 17, 32, 34, 40, 48, 60, 51, 64, 68, 80, 96, 102, 120, 85, 128, 136, 160, 170, 192, 204, 240, 255, 256, 272, 320, 340, 384, 408, 480, 510, 257, 512, 514, 544, 640, 680, 768, 816, 960, 1020, 771, 1024, 1028, 1088

Offset: 0

Labos Elemer, Nov 30 2000

phi(x) is a power of 2 if and only if x is a power of 2 multiplied by a product of distinct Fermat primes. So if, as is conjectured, there are only 5 Fermat primes, then there are only 32 possibilities for the odd part of x, namely the divisors of 2^32-1, given in A004729.
The same numbers, in increasing order, are given in A003401.
The first entry in row n is the n-th divisor of 2^32-1 for 0 <= n <= 31 (A004729) and is 2^(n+1) for n >= 32. The last entry in row n is given in A058215.

			Triangle begins:
  { 1,   2},
  { 3,   4,   6},
  { 5,   8,  10,  12},
  {15,  16,  20,  24,  30},
  {17,  32,  34,  40,  48,  60},
  {51,  64,  68,  80,  96, 102, 120},
  {85, 128, 136, 160, 170, 192, 204, 240},
  ...

T. D. Noe, Table of n, a(n) for n = 0..1000

Cf. A000010, A001317, A003401, A004729, A019434, A045544, A047999, A053576, A054432, A058214, A058215.

phiinv[ n_, pl_ ] := Module[ {i, p, e, pe, val}, If[ pl=={}, Return[ If[ n==1, {1}, {} ] ] ]; val={}; p=Last[ pl ]; For[ e=0; pe=1, e==0||Mod[ n, (p-1)pe/p ]==0, e++; pe*=p, val=Join[ val, pe*phiinv[ If[ e==0, n, n*p/pe/(p-1) ], Drop[ pl, -1 ] ] ] ]; Sort[ val ] ]; phiinv[ n_ ] := phiinv[ n, Select[ 1+Divisors[ n ], PrimeQ ] ]; Join@@(phiinv[ 2^# ]&/@Range[ 0, 10 ]) (* phiinv[ n, pl ] = list of x with phi(x)=n and all prime divisors of x in list pl. phiinv[ n ] = list of x with phi(x)=n *)

Edited by Dean Hickerson, Jan 25 2002

A058214 Sum of solutions of phi(x) = 2^n.

Original entry on oeis.org

3, 13, 35, 105, 231, 581, 1315, 3225, 6711, 15221, 32755, 74505, 154407, 339397, 718115, 1589145, 3243831, 6946421, 14482675, 31259145, 63894567, 135588037, 281203235, 601400985, 1219907127, 2557715317, 5267017715, 11123540745, 22600784679, 47205887429

Offset: 0

Labos Elemer, Nov 30 2000

nonn

			For n = 6, 2^n = 64; the solutions of phi(x) = 64 are {85,128,136,160,170,192,204,240}, whose sum is a(6) = 1315.

Amiram Eldar, Table of n, a(n) for n = 0..1000 (terms 0..100 from T. D. Noe)
Max Alekseyev, PARI/GP Scripts for Miscellaneous Math Problems (invphi.gp).

Cf. A000010, A001317, A003401, A004729, A019434, A045544, A047999, A053576, A054432, A058213, A058215.

phiinv[n_, pl_] := Module[{i, p, e, pe, val}, If[pl=={}, Return[If[n==1, {1}, {}]]]; val={}; p=Last[pl]; For[e=0; pe=1, e==0||Mod[n, (p-1)pe/p]==0, e++; pe*=p, val=Join[val, pe*phiinv[If[e==0, n, n*p/pe/(p-1)], Drop[pl, -1]]]]; Sort[val]]; phiinv[n_] := phiinv[n, Select[1+Divisors[n], PrimeQ]]; Table[Plus@@phiinv[2^n], {n, 0, 30}] (* phiinv[n, pl] = list of x with phi(x)=n and all prime divisors of x in list pl. phiinv[n] = list of x with phi(x)=n *)

a(n) = vecsum(invphi(2^n)); \\ Amiram Eldar, Nov 11 2024, using Max Alekseyev's invphi.gp

If there are only five Fermat primes, then a(n) = 2^(n-30) * 99852066765 for n > 31. - T. D. Noe, Jun 21 2012

Edited by Dean Hickerson, Jan 25 2002

a(28)-a(29) from Donovan Johnson, Oct 22 2011

A058215 Largest solution of phi(x) = 2^n.

Original entry on oeis.org

2, 6, 12, 30, 60, 120, 240, 510, 1020, 2040, 4080, 8160, 16320, 32640, 65280, 131070, 262140, 524280, 1048560, 2097120, 4194240, 8388480, 16776960, 33553920, 67107840, 134215680, 268431360, 536862720, 1073725440, 2147450880, 4294901760, 8589934590

Offset: 0

Labos Elemer, Nov 30 2000

nonn

The ratio of adjacent terms is 2 except for five terms (if there are exactly five Fermat primes). - T. D. Noe, Jun 21 2012

			For n = 6, 2^n = 64; the solutions of phi(x) = 64 are {85,128,136,160,170,192,204,240}; the largest is a(6) = 240.

Amiram Eldar, Table of n, a(n) for n = 0..1000 (terms 0..100 from T. D. Noe)
Max Alekseyev, PARI/GP Scripts for Miscellaneous Math Problems (invphi.gp).

Cf. A000010, A001317, A003401, A004729, A019434, A045544, A047999, A053576, A054432, A058213, A058214.

phiinv[ n_, pl_ ] := Module[ {i, p, e, pe, val}, If[ pl=={}, Return[ If[ n==1, {1}, {} ] ] ]; val={}; p=Last[ pl ]; For[ e=0; pe=1, e==0||Mod[ n, (p-1)pe/p ]==0, e++; pe*=p, val=Join[ val, pe*phiinv[ If[ e==0, n, n*p/pe/(p-1) ], Drop[ pl, -1 ] ] ] ]; Sort[ val ] ]; phiinv[ n_ ] := phiinv[ n, Select[ 1+Divisors[ n ], PrimeQ ] ]; Table[ phiinv[ 2^n ][ [ -1 ] ], {n, 0, 30} ] (* phiinv[ n, pl ] = list of x with phi(x)=n and all prime divisors of x in list pl. phiinv[ n ] = list of x with phi(x)=n *)

a(n) = invphiMax(2^n); \\ Amiram Eldar, Nov 11 2024, using Max Alekseyev's invphi.gp

Assuming there are only 5 Fermat primes (A019434), a(n) = 2^(n-30)*(2^32-1) for n >= 31.

Edited by Dean Hickerson, Jan 25 2002

A053159 Numbers n such that n+cototient(n) is a power of 2.

Original entry on oeis.org

1, 3, 7, 10, 20, 31, 40, 80, 127, 160, 320, 322, 640, 644, 1280, 1288, 2560, 2576, 5120, 5152, 8191, 10240, 10304, 20480, 20608, 40960, 41216, 81920, 82432, 131071, 163840, 164864, 327680, 329728, 333634, 524287, 655360, 659456, 667268, 1310720, 1318912

Offset: 1

Labos Elemer, Feb 29 2000

nonn

See especially A053579 and also A053576, A053577.

			Mersenne primes are a proper subset of this sequence: A(M)=2M-M+1=M+1=2^p

Donovan Johnson, Table of n, a(n) for n = 1..100

Cf. A000043, A000668, A001348.

print(1); for(n=3, 10^9, if(omega(2*n-eulerphi(n))==1, print(n))) /* Donovan Johnson, Apr 04 2013 */

a(n)+A051953(n) = 2*a(n)-A000010(n) = 2^w for some w.

More terms from Reiner Martin, Dec 24 2001

A053162 Nonprimes n such that n+cototient(n) is a power of 2.

Original entry on oeis.org

1, 10, 20, 40, 80, 160, 320, 322, 640, 644, 1280, 1288, 2560, 2576, 5120, 5152, 10240, 10304, 20480, 20608, 40960, 41216, 81920, 82432, 163840, 164864, 327680, 329728, 333634, 655360, 659456, 667268, 1310720, 1318912, 1334536, 1378114, 2621440

Offset: 1

Labos Elemer, Feb 29 2000

nonn

See especially A053579 and also A053576, A053577.

			Mersenne primes were deleted from set of numbers with similar property. An infinite subset here is m(r)=5*2^r, since Phi[m(r)]=2^(r+1) and a(m(r))=5*2^(r+1)-2^(r+1)=2^(r+3). A different subset includes m = 322,644,1288,.. = Set of {(2^s)*7*23} generating 2^(s+8)=2m-Phi(m) powers of 2.

Donovan Johnson, Table of n, a(n) for n = 1..100

Cf. A000043, A000668, A001348, A053159.

for(n=1, 2621440, if(isprime(n)==0, if(omega((2*n-eulerphi(n))*2)==1, print1(n ", ")))) \\ Donovan Johnson, Jan 09 2014

a(n)+A051953(n) = 2*a(n)-A000010(n) = 2^w for some w and a(n).

More terms from Olaf Voß, Feb 25 2008

A053163 n+cototient(n) produces these powers of 2 in order of magnitude.

Original entry on oeis.org

1, 4, 8, 16, 32, 32, 64, 128, 128, 256, 512, 512, 1024, 1024, 2048, 2048, 4096, 4096, 8192, 8192, 8192, 16384, 16384, 32768, 32768, 65536, 65536, 131072, 131072, 131072, 262144, 262144, 524288, 524288, 524288, 524288, 1048576, 1048576, 1048576, 2097152

Offset: 1

Labos Elemer, Feb 29 2000

See especially A053579 and also A053576, A053577.

			1+Mersenne primes powers of 2 are here, 2^p for special primes. Also because of other (infinite) subsequences, all 2-powers from 2^6 occurs at least twice.

Donovan Johnson, Table of n, a(n) for n = 1..100
Index to divisibility sequences

Cf. A000043, A000668, A001348.

Join[{1}, Reap[For[n=3, n<10^7, n++, If[PrimeNu[k = 2*n - EulerPhi[n]] == 1, Print[k]; Sow[k]]]][[2, 1]]] (* Jean-François Alcover, Jun 30 2015, after Donovan Johnson *)

print(1); for(n=3, 10^9, k=2*n-eulerphi(n); if(omega(k)==1, print(k))) /* Donovan Johnson, Apr 04 2013 */

a(n) = 2^w = m+A051953(m) = 2*m-A000010(m) for some m.

More terms from Olaf Voß, Feb 25 2008

cp's OEIS Frontend

A078168 Numbers k such that phi(k) is a perfect 8th power.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A078169 Numbers k such that phi(k) is a perfect 9th power.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A078170 Numbers k such that phi(k) is a perfect tenth power.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A293231 a(n) = Product_{d|n, dA019565(A193231(d)).

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula

A058213 Triangular arrangement of solutions of phi(x) = 2^n (n >= 0), where phi=A000010 is Euler's totient function. Each row corresponds to a particular n and its length is n+2 for 0 <= n <= 31, 32 for n >= 32. (This assumes that there are only 5 Fermat primes.)

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A058214 Sum of solutions of phi(x) = 2^n.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A058215 Largest solution of phi(x) = 2^n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A053159 Numbers n such that n+cototient(n) is a power of 2.

Views

Author

Keywords