A084189 Minimum digit out of both prime factors of the numbers in A046376.

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, 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, 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

Offset

0,1

Comments

Conjecture: a(n) is never greater than 3.

Suggested by this old JRM problem: "Find a composite palindrome larger than 343 whose prime factors are palindromes consisting of digits greater than 3."

Links

Table of n, a(n) for n=0..104.

Example

a(9)=1 because the factors of A046376(9)= 262 are 2*131 and the minimum digit is 1.

Crossrefs

Sequence in context: A371124 A267483 A071473 * A084352 A106797 A329311

Adjacent sequences: A084186 A084187 A084188 * A084190 A084191 A084192

Keyword

base,nonn

Author

Jason Earls, Jun 20 2003

Status

approved