cp's OEIS Frontend

A202090 a(n) = Fibonacci(n) - p, where p is the largest prime < Fibonacci(n).

%I A202090 #12 Aug 09 2015 01:06:20
%S A202090 2,1,2,2,3,2,6,5,4,4,3,4,14,5,4,2,7,4,8,17,8,14,31,14,10,37,20,26,9,
%T A202090 20,22,11,6,12,15,32,18,17,18,16,43,24,6,17,20,26,27,20,6,9,12,34,29,
%U A202090 36,30,47,48,4,45,32,54,27,132,22,31,4,32,11,12,60,7,76
%N A202090 a(n) = Fibonacci(n) - p, where p is the largest prime < Fibonacci(n).
%F A202090 a(n) = A049711(A000045(n)). - _R. J. Mathar_, Dec 13 2011
%e A202090 a(7) = Fibonacci(7) - 19 = 21-19 = 2;
%e A202090 a(11) = Fibonacci(11) - 83 = 89 - 83 = 6.
%p A202090 A049711 := proc(n)
%p A202090     n-prevprime(n) ;
%p A202090 end proc:
%p A202090 A202090 := proc(n)
%p A202090     A049711(combinat[fibonacci](n) );
%p A202090 end proc:
%p A202090 seq(A202090(n),n=5..80) ; # _R. J. Mathar_, Dec 13 2011
%t A202090 f[n_]:=Module[{nf=Fibonacci[n]},nf-NextPrime[nf,-1]];f/@Range[5,90]
%Y A202090 Cf. A000045.
%K A202090 nonn
%O A202090 5,1
%A A202090 _Michel Lagneau_, Dec 11 2011