login
Fibonacci[ (p - 1) ], where p = Prime[n].
3

%I #5 Aug 14 2012 06:42:04

%S 1,1,3,8,55,144,987,2584,17711,317811,832040,14930352,102334155,

%T 267914296,1836311903,32951280099,591286729879,1548008755920,

%U 27777890035288,190392490709135,498454011879264,8944394323791464

%N Fibonacci[ (p - 1) ], where p = Prime[n].

%C p = Prime[n] divides a(n) = Fibonacci(p-1) for p = {11,19,29,31,41,59,61,71,79,89,101,109,131,...} = A045468[n] Primes congruent to {1, 4} mod 5.

%H Vincenzo Librandi, <a href="/A121567/b121567.txt">Table of n, a(n) for n = 1..200</a>

%F a(n) = Fibonacci[ Prime[n] - 1 ].

%t Table[Fibonacci[Prime[n]-1],{n,1,30}]

%Y Cf. A000045, A045468, A121568, A064739.

%K nonn

%O 1,3

%A _Alexander Adamchuk_, Aug 07 2006