Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096822
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A096822 Smallest primes of form p=2^x-(2n-1) where x=A096502[n], the least exponent providing this kind of primes. +0
2
3, 5, 3, 549755813881, 7, 5, 3, 17, 47, 13, 11, 41, 7, 5, 3, 97, 31, 29, 2011, 89, 23, 536870869, 19, 17, 79, 13, 11, 73, 7, 5, 3, 193, 191, 61, 59, 953, 439, 53, 179, 433, 47, 173, 43, 41, 167, 37, 163, 929, 31, 29, 67108763, 409, 23, 149, 19, 17, 911, 13, 11, 137 (list; graph; listen)
OFFSET

1,1

EXAMPLE

a[1]=3 is the first Mersenne-prime;

a[64]=2^47-127=140737488355201, where 47=A096502[64],127=2*64-1.

CROSSREFS

Cf. A096502.

Sequence in context: A134771 A080349 A065974 this_sequence A086567 A016611 A073006

Adjacent sequences: A096819 A096820 A096821 this_sequence A096823 A096824 A096825

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jul 13 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research