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.

A306950 Numbers m that divide A177754(m) = Sum_{k=1..m} uphi(k), where uphi is the unitary totient function (A047994).

Original entry on oeis.org

1, 2, 32, 36, 39, 50, 62, 147, 169, 190, 203, 467, 1035, 1075, 2174, 2475, 27047, 28097, 91087, 181175, 215795, 539654, 580160, 668988, 868879, 2611450, 14359486, 118119399, 1030191204, 1109928219, 2362155122
Offset: 1

Views

Author

Amiram Eldar, Mar 17 2019

Keywords

Comments

The unitary version of A048290.

Examples

			32 is in the sequence since A177754(32) = 384 = 32 * 12 is divisible by 32.
		

Crossrefs

Programs

  • Mathematica
    uphi[1] = 1; uphi[n_] := Product[{p, e} = pe; p^e-1, {pe, FactorInteger[n]}]; seq={}; s = 0; Do[s = s + uphi[n]; If[Divisible[s,n], AppendTo[seq, n]], {n, 1, 10^6}]; seq (* after Jean-François Alcover at A047994 *)