Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A098873
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A098873 Least k such that 2*((6*n)^k) - 1 is prime. +0
1
1, 1, 2, 1, 1, 1, 1, 4, 1, 5, 1, 606, 7, 1, 1, 1, 2, 2, 1, 1, 1, 1, 4, 24, 8, 1, 10, 7, 1, 1, 2, 1, 3, 2, 1, 1, 1, 2, 1, 1, 1, 1, 28, 5, 2, 2484, 1, 2, 1, 1 (list; graph; listen)
OFFSET

1,3

EXAMPLE

2*((6*1)^1) - 1 = 11 prime, so a(1)=1

2*((6*2)^1) - 1 = 23 prime, so a(2)=1

2*((6*3)^1) - 1 = 35 = 5*7

2*((6*3)^2) - 1 = 647 prime, so a(3)=2

CROSSREFS

Sequence in context: A107688 A060097 A098120 this_sequence A046876 A026584 A119326

Adjacent sequences: A098870 A098871 A098872 this_sequence A098874 A098875 A098876

KEYWORD

nonn

AUTHOR

Pierre CAMI (pierrecami(AT)tele2.fr), Oct 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 December 20 00:58 EST 2009. Contains 171054 sequences.


AT&T Labs Research