id:A109631 - OEIS Search Results

Search: id:A109631

Displaying 1-1 of 1 results found.

page 1

Smallest number m such that n divides (10's complement factorial of m).

+0
6

1, 2, 1, 2, 5, 2, 3, 2, 1, 5, 12, 2, 22, 3, 5, 4, 15, 2, 24, 5, 3, 12, 31, 2, 10, 22, 4, 3, 13, 5, 38, 6, 12, 15, 5, 2, 26, 24, 22, 5, 18, 3, 14, 12, 5, 31, 53, 4, 16, 10, 15, 22, 47, 4, 12, 3, 24, 13, 41, 5, 39, 38, 3, 6, 22, 12, 33, 15, 31, 5, 29, 2, 27, 26, 10, 24, 12, 22, 21, 5, 7, 18 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`Is 374 the only n such that a(n) = a(n+1)?`
	EXAMPLE	`a(7)=3 because 7 divides (10-3)(10-2)(10-1) and 7 does not divide (10's complement factorial of k) for k < 3.`
	CROSSREFS	`Cf. A002034, A110396.` `Sequence in context: A078391 A153206 A144155 this_sequence A095149 A064192 A124218` `Adjacent sequences: A109628 A109629 A109630 this_sequence A109632 A109633 A109634`
	KEYWORD	`base,nonn`
	AUTHOR	`Jason Earls (zevi_35711(AT)yahoo.com), Aug 03 2005`

page 1

Search completed in 0.002 seconds

Last modified December 15 00:47 EST 2009. Contains 170825 sequences.

AT&T Labs Research