cp's OEIS Frontend

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.

A247390 Base-n state complexity of partitioned deterministic finite automaton (PDFA) for the periodic sequence (12345678910)*.

Table of values

n a(n)
2 41
3 40
4 21
5 11
6 11
7 40
8 41
9 20
10 11
11 10
12 41
13 40
14 21
15 11
16 11
17 40
18 41
19 20
20 11
21 10
22 41
23 40
24 21
25 11
26 11
27 40
28 41
29 20
30 11
31 10
32 41
33 40
34 21
35 11
36 11
37 40
38 41
39 20
40 11
41 10
42 41
43 40
44 21
45 11
46 11
47 40
48 41
49 20
50 11
51 10
52 41
53 40
54 21
55 11
56 11
57 40
58 41
59 20
60 11
61 10
62 41
63 40
64 21
65 11
66 11
67 40

List of values

[41, 40, 21, 11, 11, 40, 41, 20, 11, 10, 41, 40, 21, 11, 11, 40, 41, 20, 11, 10, 41, 40, 21, 11, 11, 40, 41, 20, 11, 10, 41, 40, 21, 11, 11, 40, 41, 20, 11, 10, 41, 40, 21, 11, 11, 40, 41, 20, 11, 10, 41, 40, 21, 11, 11, 40, 41, 20, 11, 10, 41, 40, 21, 11, 11, 40]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.