A084352 Minimum digit out of both prime factors of palindromic brilliant numbers.

2, 2, 3, 1, 1, 1, 1, 1, 1, 2, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 2, 0, 1, 2, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1

Offset

0,1

Comments

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

Links

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

Example

a(9)=2 because the factors of the 9th palindromic brilliant number 989 are 23*43 and the minimum digit is 2.

Crossrefs

Cf. A078972, A084189.

Sequence in context: A267483 A071473 A084189 * A106797 A329311 A308746

Adjacent sequences: A084349 A084350 A084351 * A084353 A084354 A084355

Keyword

base,nonn,less

Author

Jason Earls, Jun 22 2003

Extensions

More terms from Sean A. Irvine, Mar 31 2026

Status

approved