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.

A098186 If f[x]=(sum of unitary-proper divisors of x)=A063919[x] is iterated, the iteration may lead to a fixed point which is either 0 or belongs to A002827, a unitary-perfect-number >1: 6,60,90,87360... Sequence gives initial values for which the iteration ends in 87360, the 4th unitary perfect number.

This page as a plain text file.
%I A098186 #4 Oct 15 2013 22:32:34
%S A098186 87360,232608,356640,465144,527712,565728,713208,1018248,1055352,
%T A098186 1211352,1240032,1303728,1316904,1352568,1357584,1360416,1379280,
%U A098186 1550472,1690440,1835592,2035608,2078328,2110632,2262892,2422632
%N A098186 If f[x]=(sum of unitary-proper divisors of x)=A063919[x] is iterated, the iteration may lead to a fixed point which is either 0 or belongs to A002827, a unitary-perfect-number >1: 6,60,90,87360... Sequence gives initial values for which the iteration ends in 87360, the 4th unitary perfect number.
%e A098186 Iteration list started from n=1018248: {1018248, 1055352, 527712, 232608, 87360, 87360...}
%t A098186 di[x_] :=Divisors[x];ta={{0}}; ud[x_] :=Part[di[x], Flatten[Position[GCD[di[x], Reverse[di[x]]], 1]]]; asu[x_] :=Apply[Plus, ud[x]]-x; nsf[x_, ho_] :=NestList[asu, x, ho] Do[g=n;s=Last[NestList[asu, n, 100]];If[Equal[s, 87360], Print[{n, s}]; ta=Append[ta, n]], {n, 1, 5000000}];ta = Delete[ta, 1]
%Y A098186 Cf. A063919, A002827, A063991, A097024, A097030-A097037, A098185.
%K A098186 nonn
%O A098186 1,1
%A A098186 _Labos Elemer_, Aug 31 2004