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.

A097037 Initial values for iteration of A063919(x) function such that iteration ends in a 2-cycle, i.e., "attracted" by unitary amicable numbers, A063991.

This page as a plain text file.
%I A097037 #17 Apr 06 2019 06:35:19
%S A097037 102,114,126,388,436,484,812,866,1020,1036,1040,1116,1140,1196,1260,
%T A097037 1380,1500,1524,1532,1552,1618,1644,1716,1724,1726,1744,1916,2020,
%U A097037 2066,2068,2324,2368,2386,2486,2592,2684,2880,2924,3032,3098,3120,3124,3136
%N A097037 Initial values for iteration of A063919(x) function such that iteration ends in a 2-cycle, i.e., "attracted" by unitary amicable numbers, A063991.
%H A097037 Amiram Eldar, <a href="/A097037/b097037.txt">Table of n, a(n) for n = 1..1000</a>
%e A097037 n = 866: list = {866, 436, 114, 126, 114} ending in 2-cycle of [114, 126].
%t A097037 s[n_] := If[n > 1, Times @@ (1 + Power @@@ FactorInteger[n]) - n, 0]; useq[n_] := Most[NestWhileList[s, n, UnsameQ, All]]; amiQ[k_] := Module[{s1 = s[k]}, s1 != k && s[s1] == k]; aQ[n_] := amiQ[Last[useq[n]]]; Select[Range[5000], aQ] (* _Amiram Eldar_, Apr 06 2019 *)
%Y A097037 Cf. A002827, A063919, A063991, A097024, A097030-A097036.
%K A097037 nonn
%O A097037 1,1
%A A097037 _Labos Elemer_, Aug 30 2004