id:A052423 - OEIS Search Results

Search: id:A052423

Displaying 1-1 of 1 results found.

page 1

Highest common factor of nonzero digits of n.

+0
1

1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 4, 1, 2, 1, 4, 1, 2, 1, 4, 1, 5, 1, 1, 1, 1, 5, 1, 1, 1, 1, 6, 1, 2, 3, 2, 1, 6, 1, 2, 3, 7, 1, 1, 1, 1, 1, 1, 7, 1, 1, 8, 1, 2, 1, 4, 1, 2, 1, 8, 1, 9, 1, 1, 3, 1, 1, 3, 1, 1, 9, 1, 1, 1 (list; graph; listen)

	OFFSET	`1,2`
	EXAMPLE	`a(46)=2 because highest common factor of 4 and 6 is 2`
	CROSSREFS	`Cf. A007954.` `Sequence in context: A040997 A075877 A133500 this_sequence A126616 A121042 A000030` `Adjacent sequences: A052420 A052421 A052422 this_sequence A052424 A052425 A052426`
	KEYWORD	`base,easy,nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Mar 17 2000`

page 1

Search completed in 0.002 seconds

Last modified December 6 22:55 EST 2009. Contains 170429 sequences.

AT&T Labs Research