Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A152097
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A152097 Least k(n) such that 3*2^k(n)*M(n)-1 or 3*2^k(n)*M(n)+1 is prime (or both primes) with M(i)=i-th Mersenne prime +0
1
1, 1, 2, 1, 3, 2, 1, 5, 6, 9, 31, 44, 18, 71, 81, 1097, 64, 789, 42, 17, 908, 722, 1500, 1496, 5690, 6720, 3340, 18768, 9597, 13835 (list; graph; listen)
OFFSET

1,3

COMMENT

These are certified primes using PFGW from Primeform group

EXAMPLE

3*2^1*(2^2-1)-1=17 prime as 19 so k(1)=1 as M(1)=2^2-1 3*2^1*(2^3-1)-1=41 prime as 43 so k(2)=1 as M(2)=2^3-1 3*2^2*(2^5-1)+1=373 prime so k(3)=2 as M(3)=2^5-1

CROSSREFS

Cf. A145983.

Sequence in context: A131345 A134423 A061260 this_sequence A119442 A064861 A070979

Adjacent sequences: A152094 A152095 A152096 this_sequence A152098 A152099 A152100

KEYWORD

more,nonn

AUTHOR

Pierre CAMI (pierre-cami(AT)orange.fr), Nov 24 2008

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