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).

This page as a plain text file.
%I A361402 #6 Mar 24 2023 17:50:07
%S A361402 5,23,599,
%T A361402 7899999999999999999999999999999999999999999999999899999999999999999
%N A361402 a(1) = 5; a(n+1) is the smallest prime p > a(n) such that digsum(p) = a(n).
%e A361402 a(3) = 599 because 599 is the smallest prime > a(2) whose sum of digits is 5 + 9 + 9 = 23 = a(2).
%Y A361402 Cf. A007953, A046704, A062802.
%K A361402 nonn,base
%O A361402 1,1
%A A361402 _Ya-Ping Lu_, Mar 10 2023