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.

A193164 a(1) = 1 ; for n > 1, a(n) is the smallest number such that a(n)^2 + 1 contains n distinct prime divisors dividing a(n+1)^2 + 1.

Table of values

n a(n)
1 1
2 3
3 13
4 47
5 463
6 25683
7 4187997

List of values

[1, 3, 13, 47, 463, 25683, 4187997]