login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A097036 Initial values for iteration of A063919[x] function such that iteration ends in a 3-cycle. 9
30, 42, 54, 100, 140, 148, 194, 196, 208, 220, 238, 252, 274, 288, 300, 336, 348, 350, 364, 374, 380, 382, 386, 400, 420, 440, 492, 516, 528, 540, 542, 550, 592, 600, 612, 660, 694, 708, 720, 722, 740, 756, 758, 764, 766, 780, 792, 794, 820, 836, 900, 932 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

EXAMPLE

n=100: list={100, [30, 42, 54], 30, ... after 1 transient a 3-cycle arises.

MATHEMATICA

s[n_] := If[n > 1, Times @@ (1 + Power @@@ FactorInteger[n]) - n, 0]; useq[n_] := Most[NestWhileList[s, n, UnsameQ, All]]; cycleQ[k_] := Module[{s1 = s[k]}, s1 != k && s[s[s1]] == k]; aQ[n_] := cycleQ[Last[useq[n]]]; Select[Range[1000], aQ] (* Amiram Eldar, Apr 06 2019 *)

CROSSREFS

Cf. A002827, A063919, A063991, A097024, A097030-A097037.

Sequence in context: A074696 A127663 A008885 * A090790 A090800 A114816

Adjacent sequences:  A097033 A097034 A097035 * A097037 A097038 A097039

KEYWORD

nonn

AUTHOR

Labos Elemer, Aug 30 2004

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 8 01:59 EST 2019. Contains 329850 sequences. (Running on oeis4.)