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.

A374383 Triangle T(n, k), n > 0, k = 0..n-1, read by rows; T(n, k) is the least base b >= 2 where n and k have different sums of digits.

Table of values

n a(n)
1 2
2 2
3 3
4 2
5 2
6 2
7 2
8 3
9 4
10 2
11 2
12 2
13 2
14 3
15 2
16 2
17 2
18 2
19 3
20 2
21 3
22 2
23 2
24 2
25 2
26 2
27 2
28 2
29 2
30 3
31 3
32 2
33 3
34 2
35 2
36 2
37 2
38 2
39 2
40 5
41 2
42 3
43 3
44 2
45 2
46 2
47 2
48 2
49 3
50 2
51 3
52 4
53 2
54 2
55 3
56 2
57 2
58 2
59 2
60 2
61 2
62 2
63 4
64 2
65 2
66 2
67 2
68 2
69 2
70 3
71 2
72 3
73 5
74 2
75 2
76 3
77 4
78 2
79 2
80 2
81 2
82 2
83 2
84 2
85 2
86 5
87 2
88 2
89 2
90 4
91 2

List of values

[2, 2, 3, 2, 2, 2, 2, 3, 4, 2, 2, 2, 2, 3, 2, 2, 2, 2, 3, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 2, 3, 2, 2, 2, 2, 2, 2, 5, 2, 3, 3, 2, 2, 2, 2, 2, 3, 2, 3, 4, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 4, 2, 2, 2, 2, 2, 2, 3, 2, 3, 5, 2, 2, 3, 4, 2, 2, 2, 2, 2, 2, 2, 2, 5, 2, 2, 2, 4, 2]

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

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