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.

A258270 Consider the unitary aliquot parts, in ascending order, of a composite number. Take their sum and repeat the process deleting the minimum number and adding the previous sum. The sequence lists the numbers that after some iterations reach a sum equal to the reverse of themselves.

Table of values

n a(n)
1 6
2 75
3 133
4 1005
5 1603
6 4258
7 5299
8 84292
9 89944
10 170568
11 192901
12 303003
13 695364
14 1633303

List of values

[6, 75, 133, 1005, 1603, 4258, 5299, 84292, 89944, 170568, 192901, 303003, 695364, 1633303]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.