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 A084189 #5 Dec 15 2017 17:36:21 %S A084189 2,2,3,1,1,1,1,1,0,1,0,1,0,1,0,1,0,1,1,1,1,1,1,0,0,0,0,0,0,1,1,1,1,1, %T A084189 0,0,1,0,0,0,1,0,0,0,0,2,2,0,0,0,2,0,0,0,1,1,1,1,1,1,1,0,1,1,0,0,0,0, %U A084189 0,0,1,1,1,1,1,0,1,1,1,0,0,0,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1 %N A084189 Minimum digit out of both prime factors of the numbers in A046376. %C A084189 Conjecture: a(n) is never greater than 3. %C A084189 Suggested by this old JRM problem: "Find a composite palindrome larger than 343 whose prime factors are palindromes consisting of digits greater than 3." %e A084189 a(9)=1 because the factors of A046376(9)= 262 are 2*131 and the minimum digit is 1. %K A084189 base,nonn %O A084189 0,1 %A A084189 _Jason Earls_, Jun 20 2003