cp's OEIS Frontend

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.

%I A236385 #6 Jan 24 2014 15:44:06
%S A236385 1,9,84,1458,39366,1062882,47829690,1721868840,92980917360,
%T A236385 5020969537440,361509806695680,26028706082088960,1874066837910405120,
%U A236385 58110713122393733760,3643185932897827553280,393464080752965375754240
%N 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.
%H A236385 Ray Chandler, <a href="/A236385/b236385.txt">Table of n, a(n) for n = 0..322</a> [terms <= 1000 digits]
%H A236385 Ray Chandler, <a href="/A236385/a236385.txt">Table of n, a(n) for n = 0..440</a> [complete sequence]
%Y A236385 Cf. A005349, A007953, A114440, A235600, A235601.
%K A236385 nonn,base,fini,full
%O A236385 0,2
%A A236385 _Ray Chandler_, Jan 24 2014