cp's OEIS Frontend

A357073 For n >= 1, a(n) = A003714(n) mod n.

%I A357073 #13 Sep 11 2022 16:20:09
%S A357073 0,0,1,1,3,3,3,0,8,8,9,9,6,5,4,4,3,4,3,2,1,21,20,20,19,20,19,18,22,21,
%T A357073 20,20,19,26,24,22,21,19,19,17,15,18,16,14,13,11,19,17,15,14,12,12,10,
%U A357073 8,36,33,30,28,25,24,21,18,20,17,14,12,9,16,13,10,8,5
%N A357073 For n >= 1, a(n) = A003714(n) mod n.
%C A357073 a(n) = 0 see A276488.
%F A357073 a(n) = A003714(n) mod n.
%e A357073 a(5) = A003714(5) mod 5 = 8 mod 5 = 3.
%t A357073 fib = Select[Range[300], BitAnd[#, 2*#] == 0 &]; Mod[fib, Range[Length[fib]]] (* _Amiram Eldar_, Sep 10 2022 *)
%o A357073 (Python)
%o A357073 def A357073(n):
%o A357073     tlist, s, m = [1, 2], 0, n
%o A357073     while (t:=tlist[-1]+tlist[-2]) <= n:
%o A357073         tlist.append(t)
%o A357073     for d in tlist[::-1]:
%o A357073         s = (s<<1)%n
%o A357073         if d <= m:
%o A357073             s = (s+1)%n
%o A357073             m -= d
%o A357073     return s # _Chai Wah Wu_, Sep 11 2022
%Y A357073 Cf. A003714, A276488.
%K A357073 nonn
%O A357073 1,5
%A A357073 _Ctibor O. Zizka_, Sep 10 2022