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.

A130181 Largest 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 486
2 1215
3 4374
4 4672
5 12862
6 12649
7 23408
8 32761
9 47477
10 56852
11 59048
12 90746
13 116864
14 112346
15 139472
16 149705
17 190512
18 234247
19 254015
20 0
21 322322
22 331775
23 391238
24 446512
25 454951
26 546121
27 530145
28 316250
29 613927
30 763795
31 786664
32 809936

List of values

[486, 1215, 4374, 4672, 12862, 12649, 23408, 32761, 47477, 56852, 59048, 90746, 116864, 112346, 139472, 149705, 190512, 234247, 254015, 0, 322322, 331775, 391238, 446512, 454951, 546121, 530145, 316250, 613927, 763795, 786664, 809936]