# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a246359 Showing 1-1 of 1 %I A246359 #29 Mar 24 2021 09:52:04 %S A246359 0,1,1,1,2,2,1,1,1,1,2,2,2,2,2,2,2,2,3,3,3,3,3,3,1,1,1,1,2,2,1,1,1,1, %T A246359 2,2,2,2,2,2,2,2,3,3,3,3,3,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,3, %U A246359 3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,4 %N A246359 Maximum digit in the factorial base expansion of n (A007623). %C A246359 Maximum entry in n-th row of A108731. %H A246359 Antti Karttunen, Table of n, a(n) for n = 0..10080 %H A246359 Index entries for sequences related to factorial base representation %F A246359 From _Antti Karttunen_, Aug 29 2016: (Start) %F A246359 a(0) = 0; for n >= 1, a(n) = 1 + a(A257684(n)). %F A246359 a(0) = 0; for n >= 1, a(n) = max(A099563(n), a(A257687(n))). %F A246359 a(n) = A051903(A276076(n)). %F A246359 (End) %e A246359 Factorial base representation of 46 is "1320" as 46 = 1*4! + 3*3! + 2*2! + 0*1!, and the largest of these digits is 3, thus a(46) = 3. %t A246359 nn = 96; m = 1; While[Factorial@ m < nn, m++]; m; Table[Max@ IntegerDigits[n, MixedRadix[Reverse@ Range[2, m]]], {n, 0, nn}] (* Version 10.2, or *) %t A246359 f[n_] := Block[{a = {{0, n}}}, Do[AppendTo[a, {First@ #, Last@ #} &@ QuotientRemainder[a[[-1, -1]], Times @@ Range[# - i]]], {i, 0, #}] &@ NestWhile[# + 1 &, 0, Times @@ Range[# + 1] <= n &]; Most@ Rest[a][[All, 1]] /. {} -> {0}]; Table[Max@ f@ n, {n, 0, 96}] (* _Michael De Vlieger_, Aug 29 2016 *) %o A246359 (MIT/GNU Scheme) (define (A246359 n) (let loop ((n n) (i 2) (md 0)) (if (zero? n) md (loop (floor->exact (/ n i)) (+ i 1) (max (modulo n i) md))))) %o A246359 (Python) %o A246359 def a007623(n, p=2): return n if n