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.

A101335 Let n = d_1 d_2 ... d_k in base 10 and f(n) = Sum_{i=1..k} d_i^k; sequence gives numbers n such that n != f(n) but n = f(f(n)).

Table of values

n a(n)
1 136
2 244
3 2178
4 6514
5 58618
6 76438
7 2755907
8 6586433
9 8139850
10 9057586
11 277668893
12 756738746
13 21914086555935085
14 37878721692554416
15 187864919457180831
16 375609204308055082
17 13397885590701080090
18 40091536165423401387
19 108493282045082839040458
20 183144838903847612823687

List of values

[136, 244, 2178, 6514, 58618, 76438, 2755907, 6586433, 8139850, 9057586, 277668893, 756738746, 21914086555935085, 37878721692554416, 187864919457180831, 375609204308055082, 13397885590701080090, 40091536165423401387, 108493282045082839040458, 183144838903847612823687]