cp's OEIS Frontend

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.

A079466 Numbers k such that the "inventory" A063850 of k is a palindrome.

This page as a plain text file.
%I A079466 #10 Jul 27 2025 11:07:52
%S A079466 1,22,112,121,211,333,1113,1131,1311,3111,4444,11114,11141,11411,
%T A079466 14111,22233,22323,22332,23223,23232,23322,32223,32232,32322,33222,
%U A079466 41111,55555
%N A079466 Numbers k such that the "inventory" A063850 of k is a palindrome.
%H A079466 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.
%e A079466 The "inventory" of 112 is 2112 (two "1"s, one "2"), which is a palindrome. Hence 112 belongs to the sequence.
%t A079466 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]]; isPalin[n_] := (n == FromDigits[Reverse[IntegerDigits[n]]]); Select[Range[10^5], isPalin[g[ # ]] &]
%Y A079466 Cf. A063850. Different from A079676.
%K A079466 base,nonn
%O A079466 1,2
%A A079466 _Joseph L. Pe_, Jan 14 2003