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.

A216137 a(n) = conjectured number of integers k such that n^k has no two consecutive identical digits.

Table of values

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

List of values

[40, 24, 22, 23, 10, 12, 14, 13, 1, 8, 7, 10, 10, 8, 12, 8, 6, 6, 1, 6, 6, 9, 6, 12, 8, 9, 8, 10, 1, 8, 8, 6, 5, 6, 5, 8, 8, 5, 1, 10, 5, 4, 7, 8, 6, 4, 6, 5, 1, 6, 6, 8, 7, 6, 6, 6, 4, 5, 1, 7, 5, 5, 8, 5, 4, 4, 3, 6, 1, 4, 7, 5, 5, 8, 3, 4, 5, 7, 1, 4, 6, 7, 6]