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.

A191648 a(1)=1, a(2)=1. For n > 2, start with n and iterate the map (k -> concatenation of anti-divisors of k) until we reach a prime q; then a(n) = q. If we never reach a prime, a(n) = 0.

Table of values

n a(n)
1 1
2 1
3 2
4 3
5 23
6 3

List of values

[1, 1, 2, 3, 23, 3]