This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A064497 a(n) = prime(n) * Fibonacci(n). 2

%I

%S 2,3,10,21,55,104,221,399,782,1595,2759,5328,9553,16211,28670,52311,

%T 94223,157624,280127,480315,799058,1399169,2378531,4126752,7277425,

%U 12260693,20231054,34005777,56050961,94020520,170976163,285358479,482867186,792701293

%N a(n) = prime(n) * Fibonacci(n).

%H Harry J. Smith, <a href="/A064497/b064497.txt">Table of n, a(n) for n = 1..300</a>

%t Table[Fibonacci[n] Prime[n], {n, 35}] (* _Vincenzo Librandi_, Jun 24 2018 *)

%o (PARI) { g=0; f=1; for (n=1, 300, write("b064497.txt", n, " ", prime(n)*f); h=g; g=f; f+=h ) } \\ _Harry J. Smith_, Sep 16 2009

%o (PARI) a(n) = prime(n)*fibonacci(n); \\ _Michel Marcus_, Jun 24 2018

%o (MAGMA) [NthPrime(n)*Fibonacci(n): n in [1..40]]; // _Vincenzo Librandi_, Jun 24 2018

%Y Cf. A000040, A000045.

%K nonn

%O 1,1

%A _Tanya Khovanova_, Oct 05 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 22 00:43 EDT 2019. Contains 326169 sequences. (Running on oeis4.)