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 A079465 #11 Jul 27 2025 11:15:15
%S A079465 6,55,116,161,255,511,666,969,996,5311,9666,9999,12255,12525,12552,
%T A079465 41199,41919,41991,54246,54264,54426,71177,71717,71771,72255,72525,
%U A079465 72552,77117,77171,77711,78055,83399,83939,83993,89999,97117,97171
%N A079465 Numbers k such that the "inventory" A063850 of k is a perfect square.
%H A079465 Carlos Rivera, <a href="http://www.primepuzzles.net/puzzles/puzz_207.htm">Puzzle 207. The Inventory Sequences and Self-Inventoried Numbers</a>, The Prime Puzzles & Problems Connection. See Question 7.
%e A079465 The "inventory" of 511 is 1521 (one "5", two "1"s) = 39^2. Hence 1521 belongs to the sequence.
%t A079465 g[n_] := Module[{seen, r, d, l, i, t}, seen = {}; r = {}; d = IntegerDigits[n]; l = Length[d]; For[i = 1, i <= l, i++, t = d[[i]]; If[ ! MemberQ[seen, t], r = Join[r, IntegerDigits[Count[d, t]]]; r = Join[r, {t}]; seen = Append[seen, t]]]; FromDigits[r]]; Select[Range[10^5], IntegerQ[Sqrt[g[ # ]]] &]
%Y A079465 Cf. A063850.
%K A079465 base,nonn
%O A079465 1,1
%A A079465 _Joseph L. Pe_, Jan 14 2003