id:A063377 - OEIS Search Results

Search: id:A063377

Displaying 1-1 of 1 results found.

page 1

Sophie Germain degree of n: number of iterations of n under f(k) = 2k+1 before we reach a composite number.

+0
4

5, 2, 0, 4, 0, 1, 0, 0, 0, 3, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 2, 0, 0, 0, 0, 0, 2, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 3, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 2, 0, 0, 0, 0, 0, 6, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0 (list; graph; listen)

	OFFSET	`2,1`
	COMMENT	`a(n)>=1 means n is prime; a(n)>=2 means n is a Sophie Germain prime. Is the Sophie Germain degree always finite? Is it unbounded?`
	EXAMPLE	`a(2)=5 because 2, 5, 11, 23, 47 are prime but 95 is not.`
	CROSSREFS	`A005384, A063378.` `Cf. A093008, A093007.` `Sequence in context: A112871 A078110 A093814 this_sequence A147710 A021872 A021196` `Adjacent sequences: A063374 A063375 A063376 this_sequence A063378 A063379 A063380`
	KEYWORD	`nonn`
	AUTHOR	`Reiner Martin (reinermartin(AT)hotmail.com), Jul 14 2001`

page 1

Search completed in 0.002 seconds

Last modified November 30 22:12 EST 2008. Contains 150989 sequences.

AT&T Labs Research