Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

1,2

EXAMPLE

2*((6*1)^1) + 1 = 13 prime, so a(1)=1

2*((6*2)^1) + 1 = 25 = 5^2

2*((6*2)^2) + 1 = 289 = 17^2

2*((6*2)^3) + 1 = 3457 prime, so a(2)=3

CROSSREFS

Sequence in context: A086249 A016569 A072801 this_sequence A139436 A084642 A010281

Adjacent sequences: A098869 A098870 A098871 this_sequence A098873 A098874 A098875

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research