The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A268057 Triangle T(n,k), 1<=k<=n, read by rows: T(n,k) = number of iterations of A048158(n, A048158(n,  ... A048158(n, k)...)) to reach 0. 6
 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 2, 3, 2, 1, 1, 1, 1, 2, 2, 1, 1, 2, 2, 3, 3, 2, 1, 1, 1, 2, 1, 3, 2, 2, 1, 1, 2, 1, 2, 3, 2, 3, 2, 1, 1, 1, 2, 2, 1, 3, 3, 2, 2, 1, 1, 2, 3, 4, 2, 3, 5, 4, 3, 2, 1, 1, 1, 1, 1, 2, 1, 3, 2, 2, 2, 2, 1, 1, 2, 2, 2, 3, 2, 3, 4, 3 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 COMMENTS Each column is periodic: T(n+A003418(k),k) = T(n,k). - Robert Israel, Feb 02 2016 LINKS Peter Kagey, Table of n, a(n) for n = 1..10000 "ModernModest", Reddit discussion EXAMPLE T(5, 3) = 3 because the algorithm requires three steps to reach 0. 5 % 3 = 2 5 % 2 = 1 5 % 1 = 0 Triangle begins: 1 1 1 1 2 1 1 1 2 1 1 2 3 2 1 1 1 1 2 2 1 1 2 2 3 3 2 1 1 1 2 1 3 2 2 1 1 2 1 2 3 2 3 2 1 1 1 2 2 1 3 3 2 2 1 1 2 3 4 2 3 5 4 3 2 1 1 1 1 1 2 1 3 2 2 2 2 1 MAPLE T:= proc(n, k) option remember; local m;      if k = 0 then 0 else 1 + procname(n, n mod k) fi end proc: seq(seq(T(n, k), k=1..n), n=1..30); # Robert Israel, Feb 02 2016 CROSSREFS Cf. A003418, A048158, A107435, A268058, A268059, A268060. Sequence in context: A228525 A335234 A217467 * A107435 A196056 A161095 Adjacent sequences:  A268054 A268055 A268056 * A268058 A268059 A268060 KEYWORD tabl,nonn AUTHOR Peter Kagey, Jan 25 2016 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 November 30 16:23 EST 2021. Contains 349423 sequences. (Running on oeis4.)