login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A145671 a(n) = number of components of the graph P(n,3) (defined in Comments). 1

%I

%S 1,2,4,8,15,32,88,209,539,1403,3698,9962,26447,71579,196590,541473,

%T 1501720,4186566,11737617

%N a(n) = number of components of the graph P(n,3) (defined in Comments).

%C 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 Cf. A145667-A145674.

%K nonn,base,more

%O 1,2

%A _W. Edwin Clark_, Mar 17 2009

%E a(11)-a(19) from _Max Alekseyev_, May 12 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 2 06:52 EDT 2021. Contains 346411 sequences. (Running on oeis4.)