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.

A130691 Number of distinct unit fractions required to sum to n when using the "splitting algorithm".

Table of values

n a(n)
1 1
2 4
3 16
4 172
5 4331
6 232388
7 4865293065
8 40149851165417480
9 18146043304242768613568943751063
10 5522398183372890742378015411585945396419106762128927

List of values

[1, 4, 16, 172, 4331, 232388, 4865293065, 40149851165417480, 18146043304242768613568943751063, 5522398183372890742378015411585945396419106762128927]