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 A145672 #8 Dec 23 2024 22:08:07
%S A145672 1,2,1,2,1,1,1,3,1,2,1,1,3,1,1,5,2,3,2,2,1,2,1,4,2,2,1,2,1,1,8,3,5,3,
%T A145672 1,1,2,2,1,3,2,1,1,2,1,2,1,6,4,2,3,4,1,5,1,2,2,3,1,1,1,1,9,1,4,5,1,1,
%U A145672 2,11,6,6,2,3,1,1,4,1,1,1,3,4,1,6,2,1,4,1,2,1,4,1,2,1,1,1,1,1,1,1,1,1,1,6,1,1,1,7,1
%N A145672 a(n) = size of the n-th term in S(3) (defined in Comments).
%C A145672 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.
%H A145672 Max Alekseyev, <a href="/A145672/b145672.txt">Table of n, a(n) for n = 1..100000</a>
%Y A145672 Cf. A145667, A145668, A145669, A145670, A145671, A145673, A145674, A158576, A158577, A158578, A158579.
%K A145672 nonn,base
%O A145672 1,2
%A A145672 _W. Edwin Clark_, Mar 17 2009
%E A145672 More terms from _Max Alekseyev_, May 12 2011