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.

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

Table of values

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

List of values

[21, 42, 21, 42, 14, 8, 7, 21, 42, 21, 42, 14, 8, 7, 21, 42, 21, 42, 14, 8, 7, 21, 42, 21, 42, 14, 8, 7, 21, 42, 21, 42, 14, 8, 7, 21, 42, 21, 42, 14, 8, 7, 21, 42, 21, 42, 14, 8, 7, 21, 42, 21, 42, 14, 8, 7, 21, 42, 21, 42, 14, 8, 7, 21, 42, 21, 42, 14, 8, 7]

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

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