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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A301872 Smallest integer k >= 0 such that the maximum digit of k^2 written in factorial base equals n. 3
 0, 1, 2, 9, 10, 25, 66, 188, 568, 1808, 6024, 20955, 75816, 284520, 1104761, 4428896, 18296575, 77760442, 339474192, 1520281852, 6975531533, 32755301642, 157251442001, 771100761895, 3858854965090, 19692136783074, 102399111271982, 542217184494641 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..806 FORMULA a(n) = min { k >= 0 : max(A108731(k^2)) = n } = min { k >= 0 : A109381(k) = n }. EXAMPLE a(11) = 20955: A108731(20955^2) = [11,0,0,0,5,2,4,4,1,1,1]. MATHEMATICA Block[{nn = 10^5, r, s, t}, t = nn^2; r = Reverse@ Most@ NestWhileList[# + 1 &, 2, #! < t &]; s = Array[Max@ IntegerDigits[#^2, MixedRadix@ r] &, nn, 0]; Map[First@ FirstPosition[s, #] - 1 &, Union@ FoldList[Max, s]]] (* Michael De Vlieger, Jan 01 2019 *) CROSSREFS Cf. A007623, A108731, A109381. Sequence in context: A079747 A191576 A081346 * A290592 A058551 A119183 Adjacent sequences:  A301869 A301870 A301871 * A301873 A301874 A301875 KEYWORD nonn,base AUTHOR Alois P. Heinz, Mar 28 2018 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 January 21 01:45 EST 2022. Contains 350473 sequences. (Running on oeis4.)