id:A084352 - OEIS Search Results

Search: id:A084352

Displaying 1-1 of 1 results found.

page 1

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

+0
1

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 (list; graph; listen)

	OFFSET	`0,1`
	COMMENT	`Conjecture: a(n) is never greater than 3.`
	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: A071480 A071473 A084189 this_sequence A106797 A074313 A066422` `Adjacent sequences: A084349 A084350 A084351 this_sequence A084353 A084354 A084355`
	KEYWORD	`base,nonn`
	AUTHOR	`Jason Earls (zevi_35711(AT)yahoo.com), Jun 22 2003`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research