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 A079470 #5 Jul 26 2025 16:03:40
%S A079470 3,7,17,23,113,127,131,137,193,199,223,233,271,311,313,331,359,367,
%T A079470 431,433,439,463,479,499,503,523,587,607,641,677,691,733,773,797,809,
%U A079470 821,823,829,853,997,1009,1069,1123,1129,1187,1213,1217,1223,1231,1277,1291
%N A079470 Primes with prime inventory number (as in A063850).
%H A079470 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 A079470 The prime 127 has inventory number 111217 (one "1", one "2", one "7"), which is also prime. Hence 127 belongs to the sequence.
%t A079470 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]]; s = {}; For[j = 1, j <= 10^3, j++, temp = Prime[j]; If[PrimeQ[g[temp]], s = Append[s, temp]]]; s
%Y A079470 Cf. A063850.
%K A079470 base,easy,nonn
%O A079470 1,1
%A A079470 _Joseph L. Pe_, Jan 15 2003