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 A030286 #17 Mar 01 2025 11:17:11 %S A030286 2,3,5,7,11,353,727,919,30203,71917,3002003,7114117,9002009,111181111, %T A030286 300020003,711161117,900050009,11112721111,30000500003,71112121117, %U A030286 90005450009,1111118111111,3000002000003,7111144411117,9000005000009,111111181111111,300000020000003 %N A030286 Palindromic primes whose digits do not appear in previous term and that are increasing. %C A030286 From _Michael S. Branicky_, Feb 28 2025: (Start) %C A030286 The sequence enforces a(n) > a(n-1); else, a(7) = 101 would be the first difference. %C A030286 a(1386) has 1001 digits. (End) %H A030286 Michael S. Branicky, <a href="/A030286/b030286.txt">Table of n, a(n) for n = 1..1385</a> %H A030286 Michael S. Branicky, <a href="/A030286/a030286.py.txt">Python program</a> %o A030286 (Python) # see linked program %K A030286 nonn,base %O A030286 1,1 %A A030286 _Patrick De Geest_ %E A030286 a(25) and beyond from _Michael S. Branicky_, Feb 28 2025