id:A033677 - OEIS Search Results

Search: id:A033677

Displaying 1-1 of 1 results found.

page 1

Smallest divisor of n >= sqrt(n).

+0
25

1, 2, 3, 2, 5, 3, 7, 4, 3, 5, 11, 4, 13, 7, 5, 4, 17, 6, 19, 5, 7, 11, 23, 6, 5, 13, 9, 7, 29, 6, 31, 8, 11, 17, 7, 6, 37, 19, 13, 8, 41, 7, 43, 11, 9, 23, 47, 8, 7, 10, 17, 13, 53, 9, 11, 8, 19, 29, 59, 10, 61, 31, 9, 8, 13, 11, 67, 17, 23, 10, 71, 9, 73, 37, 15, 19, 11, 13, 79, 10 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`a(n) is the smallest k such that n appears in the k X k multiplication table, and A027424(k) is the number of n with a(n) <= k.`
	REFERENCES	`G. Tenenbaum, pp. 268ff of R. L. Graham et al., eds., Mathematics of Paul Erdos I.`
	LINKS	`T. D. Noe, Table of n, a(n) for n=1..10000`
	MAPLE	`t1 := [ ]; for n from 1 to 100 do t2 := divisors(n); sn := evalf(sqrt(n));` `for i from 1 to nops(t2) do d := t2[ nops(t2)+1-i ]; if d >= sn then m := d; fi; od: t1 := [ op(t1), m ]; od:`
	CROSSREFS	`a(n) * A033676(n) = n. Cf. A027424.` `Adjacent sequences: A033674 A033675 A033676 this_sequence A033678 A033679 A033680` `Sequence in context: A139421 A072505 A095163 this_sequence A116548 A117818 A073890`
	KEYWORD	`nonn,easy,nice`
	AUTHOR	`njas`
	EXTENSIONS	`More terms from Larry Reeves (larryr(AT)acm.org), May 04 2001`

page 1

Search completed in 0.002 seconds

Last modified October 15 09:18 EDT 2008. Contains 145015 sequences.

AT&T Labs Research