|
%I #15 Nov 05 2020 15:23:21
%S 0,1,1,2,0,3,2,2,1,5,1,0,8,13,10,2,12,15,5,10,1,1,1,0,0,25,1,2,5,15,
%T 27,2,10,33,20,0,1,1,34,10,40,21,18,2,10,1,1,0,1,25,1,2,16,21,5,26,37,
%U 1,7,0,33,27,1,2,40,21,5,2,1,15,1,0,46,1,25,2,68
%N a(n) = F(F(n)) mod n, where F = Fibonacci = A000045.
%H Alois P. Heinz, <a href="/A263112/b263112.txt">Table of n, a(n) for n = 1..10000</a>
%F a(n) = A007570(n) mod n.
%p F:= n-> (<<0|1>, <1|1>>^n)[1, 2]:
%p p:= (M, n, k)-> map(x-> x mod k, `if`(n=0, <<1|0>, <0|1>>,
%p `if`(n::even, p(M, n/2, k)^2, p(M, n-1, k).M))):
%p a:= n-> p(<<0|1>, <1|1>>, F(n), n)[1, 2]:
%p seq(a(n), n=1..80);
%Y Cf. A000045, A002708, A007570, A023172 (where a(n)=0), A263101, A274996, A338736.
%K nonn,look
%O 1,4
%A _Alois P. Heinz_, Oct 09 2015
|
