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.

A272538 Call n/m a superdivisor of n if n/m + n divides (n/m)^(n/m) + n, (n/m)^n + n/m and n^(n/m) + n/m. This sequence gives the smallest number with n superdivisors.

Table of values

n a(n)
0 2
1 1
2 406
3 2926
4 81810
5 521626
6 4276350
7 1590715126
8 266048146

List of values

[2, 1, 406, 2926, 81810, 521626, 4276350, 1590715126, 266048146]