id:A138259 - OEIS Search Results

Search: id:A138259

Displaying 1-1 of 1 results found.

page 1

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

+0
9

1, 1, 1, 3, 5, 1, 11, 3, 2, 7, 21, 3, 20, 11, 7, 6, 40, 2, 10, 219, 11, 21, 20, 3, 11, 20, 4, 119, 15, 7, 7, 6, 31, 40, 11, 3, 13, 37, 33, 219, 42, 11, 7, 130, 38, 20, 33, 6, 15, 11, 57, 20, 79, 4, 21, 119, 10, 15, 60, 219, 62, 7, 38, 9, 37, 31, 50, 259, 49, 11, 211, 3, 37, 13, 11, 219 (list; graph; listen)

	OFFSET	`1,4`
	COMMENT	`This sequence is well-defined.`
	LINKS	`Romanian Master in Mathematics Contest, Bucharest, 2007, Problem 3`
	CROSSREFS	`Cf. A129796, A138255, A138256, A138257, A138258, A138260, A138261, A138262, A138263.` `Adjacent sequences: A138256 A138257 A138258 this_sequence A138260 A138261 A138262` `Sequence in context: A112752 A101035 A026253 this_sequence A077021 A084833 A069111`
	KEYWORD	`nonn`
	AUTHOR	`Max Alekseyev (maxal(AT)cs.ucsd.edu), Mar 09 2008.`

page 1

Search completed in 0.002 seconds

Last modified October 11 09:12 EDT 2008. Contains 144832 sequences.

AT&T Labs Research