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 A145667 #15 Dec 24 2024 09:37:59
%S A145667 0,1,1,2,1,2,4,11,13,19,29,43,107,169,350,603,1134,2070,3803,7502,
%T A145667 13989,26495,50826,97369,185827,357307,690577,1332382,2565110,4958962,
%U A145667 9594425,18569626,36009794
%N A145667 a(n) = number of components of the graph P(n,2) (defined in Comments).
%C A145667 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 A145667 Cf. A104080, A014234, A145668, A145669, A145670, A145671, A145672, A145673, A145674, A158576, A158577, A158578, A158579.
%K A145667 nonn,base,more
%O A145667 1,4
%A A145667 _W. Edwin Clark_, Mar 17 2009
%E A145667 a(18)-a(31) from _Max Alekseyev_, May 12 2011
%E A145667 a(32)-a(33) from _Max Alekseyev_, Dec 23 2024