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.

A361402 a(1) = 5; a(n+1) is the smallest prime p > a(n) such that digsum(p) = a(n).

Original entry on oeis.org

5, 23, 599, 7899999999999999999999999999999999999999999999999899999999999999999
Offset: 1

Views

Author

Ya-Ping Lu, Mar 10 2023

Keywords

Examples

			a(3) = 599 because 599 is the smallest prime > a(2) whose sum of digits is 5 + 9 + 9 = 23 = a(2).
		

Crossrefs