id:A138255 - OEIS Search Results

Search: id:A138255

Displaying 1-1 of 1 results found.

page 1

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

+0
9

1, 1, 5, 4, 6, 5, 9, 8, 7, 6, 12, 15, 14, 9, 13, 8, 10, 7, 21, 28, 13, 24, 48, 15, 22, 14, 19, 9, 30, 13, 11, 8, 31, 10, 13, 21, 38, 21, 14, 39, 22, 13, 29, 63, 13, 67, 135, 65, 43, 22, 10, 15, 35, 19, 24, 9, 21, 30, 120, 28, 62, 11, 13, 16, 14, 31, 69, 20, 67, 13, 145, 21, 19, 38 (list; graph; listen)

	OFFSET	`1,3`
	COMMENT	`This sequence is well-defined.`
	LINKS	`Romanian Master in Mathematics Contest, Bucharest, 2007, Problem 3`
	CROSSREFS	`Cf. A000799, A138256, A138257, A138258, A138259, A138260, A138261, A138262, A138263.` `Adjacent sequences: A138252 A138253 A138254 this_sequence A138256 A138257 A138258` `Sequence in context: A070365 A021187 A075194 this_sequence A089687 A011502 A097995`
	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 13:47 EDT 2008. Contains 144830 sequences.

AT&T Labs Research