Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A078743
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A078743 a(n) is the Fibonacci index of b(n) in the sequence b(1), b(2), ... where b(n) is the smallest Fibonacci number > b(n-1) such that b(1) + ... + b(n) is prime. +0
2
3, 4, 6, 9, 12, 24 (list; graph; listen)
OFFSET

1,1

COMMENT

A more compact version of A078742. a(7), if it exists, >10^15

A more compact version of A078742. a(7), if it exists, > 73, because A078742(7), if it exists, >10^15. - N. Fernandez (primeness(AT)borve.org), Aug 22 2007

EXAMPLE

The smallest Fibonacci number to be prime is 2, the 3rd Fibonacci number, so a(1)=3. The smallest Fibonacci number >2 that yields a prime when added to 2 is 3, the 4th Fibonacci number, so a(2)=4. The smallest Fibonacci number >3 that yields a prime when added to 2+3 is 8, the 4th Fibonacci number, so a(3)=6.

CROSSREFS

Cf. A000045, A078742.

Sequence in context: A010430 A097922 A103109 this_sequence A096846 A140570 A032720

Adjacent sequences: A078740 A078741 A078742 this_sequence A078744 A078745 A078746

KEYWORD

nonn

AUTHOR

N. Fernandez (primeness(AT)borve.org), Dec 21 2002

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 September 8 13:03 EDT 2008. Contains 143486 sequences.


AT&T Labs Research