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 A145671 #11 Dec 23 2024 21:58:40
%S A145671 1,2,4,8,15,32,88,209,539,1403,3698,9962,26447,71579,196590,541473,
%T A145671 1501720,4186566,11737617,33005599,93296302
%N A145671 a(n) = number of components of the graph P(n,3) (defined in Comments).
%C A145671 Let H(n,b) be the Hamming graph whose vertices are the sequences of length n over the alphabet {0,1,...,b-1} with adjacency being defined by having Hamming distance 1. Let P(n,b) be the subgraph of H(n,b) induced by the set of vertices which are base b representations of primes with n digits (not allowing leading 0 digits).
%Y A145671 Cf. A145667, A145668, A145669, A145670, A145672, A145673, A145674, A158576, A158577, A158578, A158579.
%K A145671 nonn,base,more
%O A145671 1,2
%A A145671 _W. Edwin Clark_, Mar 17 2009
%E A145671 a(11)-a(19) from _Max Alekseyev_, May 12 2011
%E A145671 a(20)-a(21) from _Max Alekseyev_, Dec 23 2024