login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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

%I #6 Jan 24 2014 15:44:06

%S 1,9,84,1458,39366,1062882,47829690,1721868840,92980917360,

%T 5020969537440,361509806695680,26028706082088960,1874066837910405120,

%U 58110713122393733760,3643185932897827553280,393464080752965375754240

%N 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.

%H Ray Chandler, <a href="/A236385/b236385.txt">Table of n, a(n) for n = 0..322</a> [terms <= 1000 digits]

%H Ray Chandler, <a href="/A236385/a236385.txt">Table of n, a(n) for n = 0..440</a> [complete sequence]

%Y Cf. A005349, A007953, A114440, A235600, A235601.

%K nonn,base,fini,full

%O 0,2

%A _Ray Chandler_, Jan 24 2014

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 22:36 EDT 2024. Contains 371917 sequences. (Running on oeis4.)