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.
%I A108700 #17 Apr 12 2025 17:03:04
%S A108700 1,1,1,3,4,7,12,21,32,54,88,141,232,376,604,987,1596,2576,4180,6762,
%T A108700 10932,17710,28656,46347,75020,121392,196384,317808,514228,831978,
%U A108700 1346268,2178309,3524488,5702886,9227448,14930208,24157816,39088168
%N A108700 Number of compositions of n into odd and relatively prime parts.
%H A108700 Amiram Eldar, <a href="/A108700/b108700.txt">Table of n, a(n) for n = 1..4786</a>
%F A108700 a(n) = A007436(n) if n is odd, else a(n) = a(n/2) + A007436(n).
%F A108700 a(n) = - Sum_{d|n} mu(2*d)*Fibonacci(n/d). - _Ridouane Oudra_, Apr 12 2025
%p A108700 with(numtheory): seq(-add(mobius(2*d)*combinat[fibonacci](n/d), d in divisors(n)), n=1..80); # _Ridouane Oudra_, Apr 12 2025
%t A108700 a[n_] := a[n] = Module[{d = Divisors[n]}, m = Plus @@ (MoebiusMu /@ (n/d)*Fibonacci /@ d); If[ OddQ[n], m, a[n/2] + m]]; Table[ a[n], {n, 38}] (* _Robert G. Wilson v_, Jun 21 2005 *)
%Y A108700 Cf. A000740, A007436, A000045, A008683.
%K A108700 easy,nonn
%O A108700 1,4
%A A108700 _Vladeta Jovovic_, Jun 19 2005
%E A108700 More terms from _Robert G. Wilson v_, Jun 21 2005