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.

A130180 Number of numbers k > 1 such that (sum of digits of k^n)*(sum of digits of k^(n+1)) = k.

Table of values

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

List of values

[5, 3, 12, 2, 6, 8, 4, 1, 13, 8, 7, 14, 8, 3, 9, 1, 5, 12, 4, 0, 13, 4, 7, 7, 1, 4, 7, 2, 5, 8, 2, 4, 8, 7, 1, 10, 5, 2, 8, 4, 2, 10, 2, 6, 10, 2, 3, 6, 2, 4, 4, 2, 3, 9, 2, 3, 8, 1, 3, 8, 5, 3, 6, 4, 6, 8, 4, 3, 10, 0, 1, 6, 3, 6, 6, 4, 2, 7, 2, 1]