Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A099439
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A099439 Numbers n such that A000295(n)=2^n-n-1 is prime. +0
4
4, 10, 14, 16, 26, 50, 56, 70, 116, 2072, 6250, 13670, 14216, 14626 (list; graph; listen)
OFFSET

1,1

COMMENT

The next term is > 25000.

Equals A063791 + 1 - Herman Jamke (hermanjamke(AT)fastmail.fm), Jan 03 2008

LINKS

User group for PFGW & PrimeForm programs.

EXAMPLE

a(1)=4 because 2^4-4-1=11 is prime.

CROSSREFS

Cf. A000295 2^n-n-1 (column 2 of the Eulerian numbers), A099440 primes in A000295, A099441 2^n-n-1 is a semiprime, A099442 semiprimes in A000295.

Adjacent sequences: A099436 A099437 A099438 this_sequence A099440 A099441 A099442

Sequence in context: A114719 A116954 A102686 this_sequence A001581 A114335 A099355

KEYWORD

hard,nonn

AUTHOR

Hugo Pfoertner (hugo(AT)pfoertner.org), Oct 18 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 October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research