#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 n, a(n) for n = 1..54
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
36 543890
37 892944
38 819910
39 695090
40 754110
41 1285875
42 843160
43 518300
44 1031480
45 636800
46 986580
47 1658215
48 1136320
49 670400
50 1868508
51 1321670
52 1646380
53 947700
54 319000
#END