id:A084189 - OEIS Search Results

Search: id:A084189

Displaying 1-1 of 1 results found.

page 1

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

+0
2

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; listen)

	OFFSET	`0,1`
	COMMENT	`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."`
	EXAMPLE	`a(9)=1 because the factors of A046376(9)= 262 are 2*131 and the minimum digit is 1.`
	CROSSREFS	`Adjacent sequences: A084186 A084187 A084188 this_sequence A084190 A084191 A084192` `Sequence in context: A071474 A071480 A071473 this_sequence A084352 A106797 A074313`
	KEYWORD	`base,nonn`
	AUTHOR	`Jason Earls (zevi_35711(AT)yahoo.com), Jun 20 2003`

page 1

Search completed in 0.002 seconds

Last modified October 15 09:18 EDT 2008. Contains 145015 sequences.

AT&T Labs Research