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 A158577 #13 Dec 23 2024 14:22:01
%S A158577 4,21,143,1061,8363,68900,1,1,1,1,1,1,586044,1,1,1,1,1,1,1,1,1,1,1,1,
%T A158577 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,5096511,1,1,1,1,1,
%U A158577 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1
%N A158577 a(n) = size of the n-th term in S(10) (defined in Comments).
%C A158577 Let H(L,b) be the Hamming graph whose vertices are the sequences of length L over the alphabet {0,1,...,b-1} with adjacency being defined by having Hamming distance 1. Let P(L,b) be the subgraph of H(L,b) induced by the set of vertices which are base b representations of primes with L digits (not allowing leading 0 digits). Let S(b) be the sequence of all components of the graphs P(L,b), L>0, sorted by the smallest prime in a component.
%C A158577 Next terms not equal 1: a(416) = 45082721 and a(3771) = 404171351 (see b-file). - _Max Alekseyev_, Dec 23 2024
%H A158577 Max Alekseyev, <a href="/A158577/b158577.txt">Table of n, a(n) for n = 1..37356</a>
%Y A158577 Cf. A006879, A158576, A158578, A158579 (base 10).
%Y A158577 Cf. A145667, A145668, A145669, A145670 (base 2).
%Y A158577 Cf. A145671, A145672, A145673, A145674 (base 3).
%K A158577 base,hard,nonn
%O A158577 1,1
%A A158577 _W. Edwin Clark_, Mar 21 2009
%E A158577 Terms a(51) onward from _Max Alekseyev_, Dec 23 2024