Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A074716
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A074716 Numbers n such that 2^n-F(n) is prime, where F(n) is the n-th Fibonacci number. +0
2
2, 4, 14, 23, 55, 80, 104, 286, 335, 383, 809, 1664, 2096, 2624, 4262, 13544, 14249, 19886, 35500, 40591 (list; graph; listen)
OFFSET

1,1

COMMENT

1664 and above are psudeoprimes only. - Sam Handler (sam_5_5_5_0(AT)yahoo.com), Dec 26 2004

1664, 2096, 2624, and 4262 correspond to certified primes. (Primo 2.2.0 beta) - Ryan Propper (rpropper(AT)stanford.edu), Aug 29 2005

MATHEMATICA

Do[ If[ PrimeQ[ 2^n - Fibonacci[n]], Print[n]], {n, 1, 5000}]

CROSSREFS

Cf. A074824.

Sequence in context: A127596 A111871 A090808 this_sequence A090889 A096012 A102930

Adjacent sequences: A074713 A074714 A074715 this_sequence A074717 A074718 A074719

KEYWORD

more,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 04 2002

EXTENSIONS

Edited by Robert G. Wilson v (rgwv(AT)rgwv.com), Sep 06 2002

5 more terms from Sam Handler (sam_5_5_5_0(AT)yahoo.com), Dec 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 July 6 17:22 EDT 2008. Contains 140988 sequences.


AT&T Labs Research