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.

A126783 Smallest k > 1 such that (sum of digits of k^n)*(sum of digits of k^(n+1)) = k, or 0 if no such k exists.

Table of values

n a(n)
1 80
2 80
3 70
4 3905
5 4004
6 700
7 19278
8 32761
9 5600
10 8100
11 24940
12 10600
13 56330
14 68040
15 81760
16 149705
17 116180
18 126360
19 123580
20 0
21 65500
22 311003
23 205030
24 114400
25 454951
26 317350
27 312170
28 296270
29 359380
30 332750
31 699785
32 723338
33 498150
34 499130
35 901368

List of values

[80, 80, 70, 3905, 4004, 700, 19278, 32761, 5600, 8100, 24940, 10600, 56330, 68040, 81760, 149705, 116180, 126360, 123580, 0, 65500, 311003, 205030, 114400, 454951, 317350, 312170, 296270, 359380, 332750, 699785, 723338, 498150, 499130, 901368]