A072924 - OEIS

This site is supported by donations to The OEIS Foundation.

A072924

Least k such that floor((1+1/k)^n) is prime.

1, 2, 2, 2, 2, 2, 2, 4, 3, 3, 3, 3, 6, 8, 7, 6, 6, 7, 5, 11, 2, 2, 9, 4, 6, 10, 5, 9, 5, 6, 4, 7, 10, 11, 7, 6, 4, 3, 10, 4, 4, 3, 5, 4, 17, 6, 11, 7, 5, 14, 12, 8, 6, 11, 4, 14, 8, 7, 3, 16, 4, 21, 8, 12, 7, 8, 7, 7, 18, 12, 8, 17, 10, 12, 28, 6, 24, 16, 12, 16, 18, 7, 6, 6, 7, 11, 8, 14, 24, 8 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,2`
	FORMULA	`It seems that a(n)/sqrt(n) is bounded. More precisely for n large enough it seems that (1/2)sqrt(n) < a(n) < 3sqrt(n)`
	PROG	`(PARI) a(n)=if(n<0, 0, s=1; while(isprime(floor((1+1/s)^n)) == 0, s++); s)`
	CROSSREFS	`Sequence in context: A073130 A064136 A143526 * A036263 A168514 A060447` `Adjacent sequences: A072921 A072922 A072923 * A072925 A072926 A072927`
	KEYWORD	`easy,nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 11 2002`

Content is available under The OEIS End-User License Agreement .

Last modified February 16 11:43 EST 2012. Contains 205907 sequences.