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.

A103448 a(n) = Sum_{k=0..n} Moebius(binomial(n,k)).

This page as a plain text file.
%I A103448 #13 Sep 08 2022 08:45:16
%S A103448 1,2,1,0,3,2,6,4,1,2,6,4,0,-6,8,6,2,-2,2,-4,4,10,4,8,0,4,8,2,4,0,-2,
%T A103448 -4,2,4,0,4,2,-4,10,4,0,-8,6,-2,4,-4,8,2,2,2,2,4,6,2,0,6,2,2,2,-6,0,6,
%U A103448 4,8,2,4,2,0,0,8,-4,-2,2,4,2,0,-2,14,10,-2,2,2,4,2,4,-2,0,8,4,2,2,-2,6,0,-6,14,2,0,2,2,2,4,0,2,-2
%N A103448 a(n) = Sum_{k=0..n} Moebius(binomial(n,k)).
%C A103448 Row sums of A103447.
%H A103448 G. C. Greubel, <a href="/A103448/b103448.txt">Table of n, a(n) for n = 0..1000</a>
%F A103448 a(n) = Sum_{k=0..n} Moebius(binomial(n,k)).
%F A103448 a(n) = Sum_{k=0..n} A008683(A007318(n,k)).
%e A103448 a(4)=3 because mu(1) + mu(4) + mu(6) + mu(4) + mu(1) = 1 + 0 + 1 + 0 + 1 = 3.
%t A103448 Table[Sum[MoebiusMu[Binomial[n, k]], {k,0,n}], {n,0,120}] (* _G. C. Greubel_, Jun 16 2021 *)
%o A103448 (Magma) [(&+[ MoebiusMu(Binomial(n, k)): k in [0..n]]): n in [0..120]]; // _G. C. Greubel_, Jun 16 2021
%o A103448 (Sage) [sum(moebius(binomial(n, k)) for k in (0..n)) for n in (0..120)] # _G. C. Greubel_, Jun 16 2021
%o A103448 (PARI) a(n) = sum(k=0, n, moebius(binomial(n, k))); \\ _Michel Marcus_, Jun 17 2021
%Y A103448 Cf. A007318, A008683, A103447, A103449.
%K A103448 sign
%O A103448 0,2
%A A103448 _Emeric Deutsch_, Feb 07 2005