Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A152141
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A152141 Least k(n) such that 3*2^n*(2^k(n)-1)-1 or 3*2^n*(2^k(n)-1)+1 is prime ( or both primes ) +0
2
1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, 2, 2, 2, 3, 2, 1, 5, 7, 2, 4, 4, 4, 8, 9, 3, 4, 4, 1, 11, 13, 2, 1, 9, 1, 3, 1, 5, 8, 1, 2, 1, 5, 6, 20, 15, 6, 7 (list; graph; listen)
OFFSET

0,10

LINKS

Pierre CAMI, Table of n, a(n) for n = 0..1600

EXAMPLE

3*2^0*(2^1-1)-1=2 prime so k(0)=1 3*2^1*(2^1-1)-1=5 prime as 7 so k(1)=1 3*2^2*(2^1-1)-1=23 prime so k(2)=1

CROSSREFS

Sequence in context: A135910 A107333 A161642 this_sequence A098505 A021306 A125300

Adjacent sequences: A152138 A152139 A152140 this_sequence A152142 A152143 A152144

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.006 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 December 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research