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.

A294179 a(n) is the smallest k with n prime factors such that p^k == p (mod k) for every prime p dividing k.

Table of values

n a(n)
1 2
2 65
3 561
4 41041
5 825265
6 321197185
7 5394826801
8 232250619601
9 9746347772161

List of values

[2, 65, 561, 41041, 825265, 321197185, 5394826801, 232250619601, 9746347772161]