Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A104060
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A104060 Least k such that k*(k+1)*2^n-1 is prime. +0
1
1, 1, 2, 1, 2, 1, 9, 4, 3, 2, 17, 1, 5, 7, 9, 1, 2, 1, 17, 11, 9, 12, 20, 14, 24, 6, 9, 9, 41, 1, 14, 3, 2, 23, 9, 3, 2, 17, 59, 5, 3, 2, 30, 11, 21, 4, 39, 21, 41, 6, 32, 4, 3, 2, 72, 10, 39, 9, 72, 1, 36, 3, 2, 14, 17, 13, 84, 10, 15, 4, 122, 5, 6, 3, 2, 10, 41, 15, 5, 13, 5, 13, 90, 9, 38, 32 (list; graph; listen)
OFFSET

1,3

COMMENT

When k(n)=1 n+1 is prime and the prime is a Mersenne-prime when k(n)=3 then k(n+1)=2 and same prime for n and n+1

EXAMPLE

1*2*2^1-1=3 prime so k(1)=1

1*2*2^2-1=7 prime so k(2)=1

2*3*2^3-1=47 prime so k(3)=2

9*10*2^7-1=11519 prime so k(7)=9

CROSSREFS

Adjacent sequences: A104057 A104058 A104059 this_sequence A104061 A104062 A104063

KEYWORD

nonn

AUTHOR

Pierre CAMI (pierrecami(AT)tele2.fr), Mar 31 2005

EXTENSIONS

Reformulated the definition - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 13 2009

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


AT&T Labs Research