Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A138183
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A138183 Smallest Fibonacci number not less than the nth prime. +0
4
2, 3, 5, 8, 13, 13, 21, 21, 34, 34, 34, 55, 55, 55, 55, 55, 89, 89, 89, 89, 89, 89, 89, 89, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 233, 233, 233, 233, 233, 233, 233, 233, 233, 233, 233, 233, 233, 233, 233, 233, 233, 377, 377 (list; graph; listen)
OFFSET

1,1

EXAMPLE

a(4) = 8 because the 8 is the smallest Fibonacci number not less than 7 (the 4th prime)

CROSSREFS

Cf. A138182, A138185.

Adjacent sequences: A138180 A138181 A138182 this_sequence A138184 A138185 A138186

Sequence in context: A065076 A069638 A010076 this_sequence A076591 A078695 A121367

KEYWORD

easy,nonn

AUTHOR

Colm Mulcahy (colm(AT)spelman.edu), Mar 04 2008

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 May 16 01:24 EDT 2008. Contains 139630 sequences.


AT&T Labs Research