A236385 - OEIS

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

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: A166902 A348316 A275394 * A335670 A196434 A197197

Adjacent sequences: A236382 A236383 A236384 * A236386 A236387 A236388

KEYWORD

nonn,base,fini,full

AUTHOR

Ray Chandler, Jan 24 2014

STATUS

approved