id:A091136 - OEIS Search Results

Search: id:A091136

Displaying 1-1 of 1 results found.

page 1

Smallest number m such that number of times m divides k! is almost k/n for large k, i.e. smallest m with A090624(m)=n.

+0
2

1, 2, 3, 8, 5, 32, 7, 128, 25, 512, 11, 2048, 13, 8192, 2187, 32768, 17, 131072, 19, 524288, 121, 2097152, 23, 8388608, 169, 33554432, 1594323, 134217728, 29, 536870912, 31, 2147483648, 289, 8589934592, 129140163, 34359738368, 37 (list; graph; listen)

	OFFSET	`0,2`
	FORMULA	`a(n) =min_p{p prime and n divisible by p-1} p^(n/(p-1)). a(p-1)=p. a(2n+1)=2^(2n+1). Smallest divisor of A091137(n) which is not a divisor of A091137(n-1).`
	EXAMPLE	`a(2)=3 noting that 100! is a multiple of 3^48 and 48 is almost 100/2.`
	CROSSREFS	`Cf. A090622, A090624, A091137.` `Sequence in context: A053650 A119794 A117987 this_sequence A140651 A007955 A162537` `Adjacent sequences: A091133 A091134 A091135 this_sequence A091137 A091138 A091139`
	KEYWORD	`nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Dec 19 2003`

page 1

Search completed in 0.002 seconds

Last modified November 24 14:25 EST 2009. Contains 167438 sequences.

AT&T Labs Research