cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A121567 #5 Aug 14 2012 06:42:04
%S A121567 1,1,3,8,55,144,987,2584,17711,317811,832040,14930352,102334155,
%T A121567 267914296,1836311903,32951280099,591286729879,1548008755920,
%U A121567 27777890035288,190392490709135,498454011879264,8944394323791464
%N A121567 Fibonacci[ (p - 1) ], where p = Prime[n].
%C A121567 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 A121567 Vincenzo Librandi, <a href="/A121567/b121567.txt">Table of n, a(n) for n = 1..200</a>
%F A121567 a(n) = Fibonacci[ Prime[n] - 1 ].
%t A121567 Table[Fibonacci[Prime[n]-1],{n,1,30}]
%Y A121567 Cf. A000045, A045468, A121568, A064739.
%K A121567 nonn
%O A121567 1,3
%A A121567 _Alexander Adamchuk_, Aug 07 2006