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.

A047919 Triangular array read by rows: a(n,k) = Sum_{d|k} mu(d)*U(n,k/d)/n if k|n else 0, where U(n,k) = A047916(n,k) (1<=k<=n).

Original entry on oeis.org

1, 1, 0, 2, 0, 0, 2, 0, 0, 4, 4, 0, 0, 0, 20, 2, 4, 6, 0, 0, 108, 6, 0, 0, 0, 0, 0, 714, 4, 4, 0, 40, 0, 0, 0, 4992, 6, 0, 30, 0, 0, 0, 0, 0, 40284, 4, 16, 0, 0, 380, 0, 0, 0, 0, 362480, 10, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3628790, 4, 8, 60, 312, 0, 3768, 0, 0, 0, 0
Offset: 1

Views

Author

Keywords

References

  • J. E. A. Steggall, On the numbers of patterns which can be derived from certain elements, Mess. Math., 37 (1907), 56-61.

Crossrefs

Divide n-th row of array A047918 by n.
Cf. A002024.

Programs

  • Haskell
    a047919 n k = a047919_tabl !! (n-1) !! (k-1)
    a047919_row n = a047919_tabl !! (n-1)
    a047919_tabl = zipWith (zipWith div) a047918_tabl a002024_tabl
    -- Reinhard Zumkeller, Mar 19 2014
  • Mathematica
    U[n_, k_] := If[Divisible[n, k], EulerPhi[n/k]*(n/k)^k*k!, 0]; a[n_, k_] := Sum[If[Divisible[n, k], MoebiusMu[d]*U[n, k/d], 0], {d, Divisors[k]}]; row[n_] := Table[a[n, k], {k, 1, n}]/n; Table[row[n], {n, 1, 12}] // Flatten (* Jean-François Alcover, Nov 21 2012, after A047918 *)

Extensions

Offset corrected by Reinhard Zumkeller, Mar 19 2014