Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A059670
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A059670 F(n)*2^n + 1 (A006483) is prime, where F(n) is the n-th Fibonacci number. +0
2
1, 2, 3, 13, 16, 20, 28, 83, 136, 300, 765, 1005, 1395 (list; graph; listen)
OFFSET

1,2

MATHEMATICA

Do[ If[ PrimeQ[ Fibonacci[ n ]*2^n + 1 ], Print[ n ] ], {n, 1, 3000} ]

CROSSREFS

Cf. A006483.

Sequence in context: A100385 A128460 A101541 this_sequence A038975 A059456 A019394

Adjacent sequences: A059667 A059668 A059669 this_sequence A059671 A059672 A059673

KEYWORD

nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 05 2001

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 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research