login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A084189 Minimum digit out of both prime factors of the numbers in A046376. 1
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 (list; graph; refs; listen; history; text; internal format)
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
EXAMPLE
a(9)=1 because the factors of A046376(9)= 262 are 2*131 and the minimum digit is 1.
CROSSREFS
Sequence in context: A071480 A267483 A071473 * A084352 A106797 A329311
KEYWORD
base,nonn
AUTHOR
Jason Earls, Jun 20 2003
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 3 22:39 EDT 2023. Contains 365872 sequences. (Running on oeis4.)