id:A146768 - OEIS Search Results

Search: id:A146768

Displaying 1-1 of 1 results found.

page 1

a(n) = numbers k such that 2(2^k)^2-1 = (n+1)-th Mersenne Prime = A000668(n+1)

+0
1

1, 2, 3, 6, 8, 9, 15, 30, 44, 53, 63, 260, 303, 639, 1101, 1140, 1608, 2126, 2211, 4844, 4970, 5606, 9968, 10850, 11604, 22248, 43121, 55251, 66024, 108045, 378419, 429716, 628893, 699134, 1488110, 1510688, 3486296, 6733458 (list; graph; listen)

	OFFSET	`1,2`
	LINKS	`Helmes B., 10. Mersenne Numbers and the polynom f(x)=2x^2-1`
	CROSSREFS	`A000668` `Sequence in context: A111215 A099381 A089437 this_sequence A122479 A047403 A093193` `Adjacent sequences: A146765 A146766 A146767 this_sequence A146769 A146770 A146771`
	KEYWORD	`nonn`
	AUTHOR	`Artur Jasinski (grafix(AT)csl.pl), Nov 02 2008`
	EXTENSIONS	`In expression in title line inspite 2(2k)^2-1 should be 2(2^k)^2-1 (^ sign was eaten). - Artur Jasinski (grafix(AT)csl.pl), Nov 05 2008` `Added a term for the 39th Mersenne prime. - Roderick(Roddy) Macphee (science_man_88(AT)yahoo.com), Oct 05 2009`

page 1

Search completed in 0.003 seconds

Last modified December 10 00:48 EST 2009. Contains 170565 sequences.

AT&T Labs Research