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.

A269309 Consider the Euler totient function of a number x. Take the sum of its digits. Repeat the process deleting the first addendum and adding the previous sum. The sequence lists the numbers that after some iterations reach x.

Table of values

n a(n)
1 13
2 21
3 63
4 177
5 206
6 412
7 655
8 824
9 1990
10 2637
11 11438
12 12485
13 23846
14 34132
15 40528
16 56202
17 87539
18 94597
19 1288999
20 3075239
21 3106991
22 20689503
23 31173397
24 46230492
25 65889985
26 79476719
27 170859904
28 266368503
29 295845211
30 420471958
31 445169688
32 797687940
33 962257660

List of values

[13, 21, 63, 177, 206, 412, 655, 824, 1990, 2637, 11438, 12485, 23846, 34132, 40528, 56202, 87539, 94597, 1288999, 3075239, 3106991, 20689503, 31173397, 46230492, 65889985, 79476719, 170859904, 266368503, 295845211, 420471958, 445169688, 797687940, 962257660]