id:A138262 - OEIS Search Results

Search: id:A138262

Displaying 1-1 of 1 results found.

page 1

Smallest positive integer m such that n divides [9^m/m] (=A129799(m)).

+0
9

1, 2, 1, 2, 2, 11, 5, 2, 1, 2, 10, 11, 19, 13, 11, 11, 7, 11, 28, 2, 13, 10, 6, 11, 11, 19, 3, 13, 15, 11, 61, 13, 11, 8, 13, 11, 19, 28, 19, 2, 4, 13, 60, 10, 11, 12, 24, 11, 5, 11, 41, 19, 79, 82, 10, 13, 28, 15, 233, 11, 10, 61, 13, 17, 19, 11, 12, 8, 12, 13, 36, 11, 13, 19, 11, 37 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`This sequence is well-defined.`
	LINKS	`Romanian Master in Mathematics Contest, Bucharest, 2007, Problem 3` `Problem 3, "Romanian Master in Mathematics" contest, Bucharest, 2007.`
	CROSSREFS	`Cf. A129799, A138255, A138256, A138257, A138258, A138259, A138260, A138261, A138263.` `Adjacent sequences: A138259 A138260 A138261 this_sequence A138263 A138264 A138265` `Sequence in context: A023140 A110775 A092186 this_sequence A127510 A129390 A129391`
	KEYWORD	`nonn`
	AUTHOR	`Max Alekseyev (maxal(AT)cs.ucsd.edu), Mar 09 2008.`

page 1

Search completed in 0.002 seconds

Last modified October 13 20:18 EDT 2008. Contains 145016 sequences.

AT&T Labs Research