This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A331171 #7 Jan 12 2020 23:50:35 %S A331171 0,1,2,3,2,3,6,7,8,9,10,11,12,13,14,15,14,15,6,7,10,11,8,9,24,25,26, %T A331171 27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49, %U A331171 50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,48,49,52,53,50,51,66,67,70,71,68,69,60,61,64,65,62,63,54,55,58,59 %N A331171 a(n) = min(n, A225901(n)), where A225901 is factorial base flip. %C A331171 For all i, j: %C A331171 a(i) = a(j) => A060130(i) = A060130(j). %C A331171 For all i, j > 0: %C A331171 a(i) = a(j) => A055881(i) = A055881(j). %H A331171 Antti Karttunen, <a href="/A331171/b331171.txt">Table of n, a(n) for n = 0..40319</a> %H A331171 <a href="/index/Fa#facbase">Index entries for sequences related to factorial base representation</a> %F A331171 a(n) = min(n, A225901(n)). %o A331171 (PARI) %o A331171 A225901(n) = { my(s=0, d, k=2); while(n, d=n%k; n=n\k; if(d, s += (k-d)*(k-1)!); k=k+1); (s); }; %o A331171 A331171(n) = min(n, A225901(n)); %Y A331171 Cf. A055881, A060130, A225901. %Y A331171 Cf. also A330740, A331172. %K A331171 nonn,base %O A331171 0,3 %A A331171 _Antti Karttunen_, Jan 12 2020