login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
OFFSET
0,3
LINKS
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
KEYWORD
nonn,base
AUTHOR
Alois P. Heinz, Mar 28 2018
STATUS
approved