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 A079464 #10 Jul 27 2025 11:07:26
%S A079464 1,3,7,9,17,23,27,33,39,51,63,69,81,93,99,111,113,127,131,133,137,193,
%T A079464 199,203,209,223,232,233,271,299,301,311,313,331,359,361,367,371,377,
%U A079464 414,431,433,439,441,447,451,463,469,474,477,479,481,497,499,503,523
%N A079464 Numbers k such that the "inventory" A063850 of k is prime.
%H A079464 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 A079464 The "inventory" of 299 is 1229 (one "2", two "9"s), which is prime. Hence 299 belongs to the sequence.
%t A079464 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^3], PrimeQ[g[ # ]] &]
%Y A079464 Cf. A063850.
%K A079464 base,nonn
%O A079464 1,2
%A A079464 _Joseph L. Pe_, Jan 14 2003