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.
%I A239719 #12 Jun 02 2023 15:02:19
%S A239719 89,809,6569,65609,531521,538001,590489,4782977,4783697,47829689,
%T A239719 3486784409,3491567369,3529831121,31768480097,34867844009,
%U A239719 282430067921,285916320881,313810596089,2541865834889,22877179875449,25418658283289
%N A239719 Primes of the form m = 9^i + 9^j - 1, where i > j >= 0.
%C A239719 The base-9 representation of a term 9^i + 9^j - 1 has base-9 digital sum = 1 + 8*j == 1 (mod 8).
%C A239719 In base-9 representation the first terms are 108, 1088, 10008, 108888, 1000088, 1008888, 1088888, 10000008, 10000888, 108888888, 10000000008, 10008888888, 10088888888, 100888888888, ...
%H A239719 Hieronymus Fischer, <a href="/A239719/b239719.txt">Table of n, a(n) for n = 1..40</a>
%e A239719 a(1) = 89, since 89 = 9^2 + 9^1 - 1 is prime.
%e A239719 a(2) = 809, since 809 = 9^3 + 9^2 - 1 is prime.
%t A239719 Select[Flatten[Table[9^i+9^j-1,{i,0,20},{j,0,i-1}]],PrimeQ] (* _Harvey P. Dale_, Jun 02 2023 *)
%o A239719 (Smalltalk)
%o A239719 A239719
%o A239719 "Answer an array of the first n terms of A239719.
%o A239719 Uses method primesWhichAreDistinctPowersOf: b withOffset: d from A239712.
%o A239719 Usage: n A239719
%o A239719 Answer: #(89 809 ... ) [a(1) ... a(n)]"
%o A239719 ^self primesWhichAreDistinctPowersOf: 9 withOffset: -1
%K A239719 nonn
%O A239719 1,1
%A A239719 _Hieronymus Fischer_, Apr 14 2014