This site is supported by donations to The OEIS Foundation.

 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!)
 A236385 Largest number m such that repeated application of A235600 takes n steps to reach 1, where A235600(k) = k/A007953(k) if the digital sum A007953(k) divides k, A235600(k) = k otherwise. 3
 1, 9, 84, 1458, 39366, 1062882, 47829690, 1721868840, 92980917360, 5020969537440, 361509806695680, 26028706082088960, 1874066837910405120, 58110713122393733760, 3643185932897827553280, 393464080752965375754240 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Ray Chandler, Table of n, a(n) for n = 0..322 [terms <= 1000 digits] Ray Chandler, Table of n, a(n) for n = 0..440 [complete sequence] CROSSREFS Cf. A005349, A007953, A114440, A235600, A235601. Sequence in context: A024118 A166902 A275394 * A196434 A197197 A295118 Adjacent sequences:  A236382 A236383 A236384 * A236386 A236387 A236388 KEYWORD nonn,base,fini,full AUTHOR Ray Chandler, Jan 24 2014 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.

Last modified December 6 14:15 EST 2019. Contains 329806 sequences. (Running on oeis4.)