cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Previous Showing 21-22 of 22 results.

A172464 Numbers n such that phi(phi(n)) + sigma(sigma(n)) is a 4th power.

Original entry on oeis.org

9, 42, 101, 339, 407, 420, 471, 915, 1409, 2572, 2847, 3706, 4069, 6631, 6720, 7229, 9212, 14051, 16641, 31453, 33067, 33146, 35701, 37425, 37675, 37911, 48016, 48272, 53101, 55956, 56906, 68895, 73474, 75023, 83525, 84676, 86928, 94525, 101428, 101743, 115925
Offset: 1

Views

Author

Michel Lagneau, Feb 03 2010

Keywords

Examples

			phi(phi(9)) + sigma(sigma(9))= 1;
phi(phi(42)) + sigma(sigma(42))= 4^4 = 256;
phi(phi(101)) + sigma(sigma(101))= 4^4 = 256;
phi(phi(339)) + sigma(sigma(339))= 6^4 = 1296.
		

References

  • W. L. Glaisher, Number-Divisor Tables. British Assoc. Math. Tables, Vol. 8, Camb. Univ. Press, 1940, p. 64.
  • S. W. Golomb, Equality among number-theoretic functions, Abstract 882-11-16, Abstracts Amer. Math. Soc., 14 (1993), 415-416.
  • R. K. Guy, Unsolved Problems in Number Theory, B42.

Crossrefs

Programs

  • Maple
    with(numtheory): for n from 1 to 2000000 do;if floor(( phi(phi(n)) + sigma(sigma(n)))^.25) =( phi(phi(n)) + sigma(sigma(n)))^.25 then print (n);fi ; od;
  • Mathematica
    Select[Range[116000],IntegerQ[Surd[DivisorSigma[1,DivisorSigma[1,#]]+ EulerPhi[ EulerPhi[ #]],4]]&] (* Harvey P. Dale, Aug 16 2021 *)

Extensions

a(40)-a(41) from Hiroaki Yamanouchi, Sep 19 2014

A172465 Numbers n such that phi(phi(n)) + sigma(sigma(n)) is an 8th power.

Original entry on oeis.org

42, 101, 6720, 9212, 226570, 276404, 288086, 299668, 339098, 392228, 412276, 423395, 530917, 535759, 559427, 564209, 666181, 2835284, 3592300, 3911744, 4080100, 5980673, 7230960, 8787900, 14960924, 17130550, 23324242, 27449729, 30437729, 33869141, 42073800
Offset: 1

Views

Author

Michel Lagneau, Feb 03 2010

Keywords

Examples

			phi(phi(9)) + sigma(sigma(9))= 1;
phi(phi(42)) + sigma(sigma(42))= 2^8 = 256;
phi(phi(101)) + sigma(sigma(101))= 2^8 = 256;
phi(phi(6720)) + sigma(sigma(6720))= 4^8 = 65536.
		

References

  • W. L. Glaisher, Number-Divisor Tables. British Assoc. Math. Tables, Vol. 8, Camb. Univ. Press, 1940, p. 64.
  • S. W. Golomb, Equality among number-theoretic functions, Abstract 882-11-16, Abstracts Amer. Math. Soc., 14 (1993), 415-416.
  • R. K. Guy, Unsolved Problems in Number Theory, B42.

Crossrefs

Programs

  • Maple
    with(numtheory):for n from 1 to 2000000 do;if floor(( phi(phi(n)) + sigma(sigma(n)))^.125) = (phi(phi(n)) + sigma(sigma(n)))^.125 then print (n);fi ; od;
  • PARI
    isok(n) = ispower(eulerphi(eulerphi(n)) + sigma(sigma(n)), 8); \\ Michel Marcus, Sep 20 2014

Extensions

a(10) corrected and a(18)-a(31) added by Hiroaki Yamanouchi, Sep 19 2014
Previous Showing 21-22 of 22 results.