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.

A352671 a(n) is the number of nonnegative numbers k < n such that for any base b >= 2, the sum of digits of n and k in base b are different.

Table of values

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

List of values

[1, 1, 2, 2, 2, 1, 3, 3, 3, 2, 5, 2, 2, 3, 4, 3, 4, 3, 4, 2, 2, 1, 7, 2, 2, 3, 6, 3, 5, 1, 4, 4, 3, 3, 7, 3, 3, 3, 7, 3, 4, 1, 4, 4, 2, 2, 8, 3, 4, 4, 3, 4, 6, 4, 7, 3, 2, 1, 9, 2, 2, 3, 7, 5, 8, 3, 4, 3, 5, 2, 7, 4, 4, 3, 5, 4, 4, 1, 8, 4, 4, 3, 7, 3, 2, 2, 6]