login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A257291 Number of states in minimal DFA accepting base-2 representation of first n prime numbers. 1
4, 4, 5, 5, 6, 8, 9, 9, 10, 11, 11, 12, 13, 13, 14, 16, 17, 17, 19, 20, 21, 21, 21, 22, 23 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

By "DFA" we mean deterministic finite automaton, which must be "complete" (that is, a transition must exist for every state).  So the minimal DFA for n = 1 corresponds to a DFA that accepts the string "10" and no other.  Four states are required since a "dead state" is also needed.

LINKS

Table of n, a(n) for n=1..25.

CROSSREFS

Cf. A257371.

Sequence in context: A003869 A065864 A120205 * A152465 A082968 A136013

Adjacent sequences:  A257288 A257289 A257290 * A257292 A257293 A257294

KEYWORD

nonn,more

AUTHOR

Jeffrey Shallit, Apr 21 2015

STATUS

approved

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 July 18 19:00 EDT 2019. Contains 325144 sequences. (Running on oeis4.)