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 A378492 #27 Dec 01 2024 14:32:57 %S A378492 0,1,4,9,144,441,1444,29929,55225,166464,255025,299209,633616,646416, %T A378492 767376,4999696,9696996,34433424,228281881,414041104,414488881, %U A378492 424442404,536663556,969699600,1649496996,1929229929,2636206336,2666999449,2929299129,2996029696,4664343616 %N A378492 Squares where larger digits have larger multiplicity. %H A378492 Alois P. Heinz, <a href="/A378492/b378492.txt">Table of n, a(n) for n = 1..500</a> %p A378492 filter:= proc(n) local L,S; %p A378492 L:= convert(n,base,10); %p A378492 S:= Statistics:-Tally(L,output=list); %p A378492 S:= sort(S, (a,b) -> lhs(a) < lhs(b)); %p A378492 andmap(t -> rhs(S[t])<rhs(S[t+1]), [$1..nops(S)-1]) %p A378492 end proc: %p A378492 select(filter, [seq(i^2, i=0..10^5)]); # _Robert Israel_, Nov 29 2024 %t A378492 increasingQ[L_]:=Min[Rest[(L-RotateRight[L])]]>0; %t A378492 sortedQ[n_]:=increasingQ[Sort[Tally[IntegerDigits[n]]][[All,2]]] %t A378492 Select[Range[575000000]^2,sortedQ] %Y A378492 Cf. A000290, A018884, A052046, A235718, A378498. %K A378492 nonn,base %O A378492 1,3 %A A378492 _Erich Friedman_, Nov 28 2024