Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A108062
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A108062 Numbers n such that 2^(2n-1) + 2^n + 1 is prime. +0
2
1, 2, 3, 6, 10, 15, 79, 82, 142, 190, 499, 5071 (list; graph; listen)
OFFSET

1,2

LINKS

Jacques Basaldua, All Fermat and Mersenne numbers are squarefree..

MATHEMATICA

Do[ If[ PrimeQ[2^(2n - 1) + 2^n + 1], Print[n]], {n, 5500}] (from Robert G. Wilson v (rgwv(AT)rgwv.com), Jun 03 2005)

CROSSREFS

A006599(n)=a(n)-1.

Sequence in context: A055789 A048681 A051891 this_sequence A075623 A024801 A101277

Adjacent sequences: A108059 A108060 A108061 this_sequence A108063 A108064 A108065

KEYWORD

base,nonn

AUTHOR

Alexandre Wajnberg (alexandre.wajnberg(AT)ulb.ac.be), Jun 02 2005

EXTENSIONS

a(1) and a(12) from Robert G. Wilson v (rgwv(AT)rgwv.com), Jun 03 2005

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