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.

A269310 Consider a number x > 1. 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 the Euler totient function of x.

Table of values

n a(n)
1 22
2 44
3 55
4 88
5 98
6 136
7 162
8 166
9 241
10 462
11 1020
12 2040
13 2416
14 2899
15 3060
16 4080
17 5110
18 7942
19 10738
20 10996
21 15006
22 24822
23 57040
24 67054
25 70625
26 75588
27 96888
28 261524
29 301834
30 507471
31 735840
32 816584
33 2893877
34 6081064
35 8155616
36 16513570
37 18772258
38 40833543

List of values

[22, 44, 55, 88, 98, 136, 162, 166, 241, 462, 1020, 2040, 2416, 2899, 3060, 4080, 5110, 7942, 10738, 10996, 15006, 24822, 57040, 67054, 70625, 75588, 96888, 261524, 301834, 507471, 735840, 816584, 2893877, 6081064, 8155616, 16513570, 18772258, 40833543]