(Translated by https://www.hiragana.jp/)
# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a047918 Showing 1-1 of 1 %I A047918 #16 Jun 24 2017 20:05:18 %S A047918 1,2,0,6,0,0,8,0,0,16,20,0,0,0,100,12,24,36,0,0,648,42,0,0,0,0,0,4998, %T A047918 32,32,0,320,0,0,0,39936,54,0,270,0,0,0,0,0,362556,40,160,0,0,3800,0, %U A047918 0,0,0,3624800,110,0,0,0,0,0,0,0,0,0,39916690,48,96 %N A047918 Triangular array read by rows: a(n,k) = Sum_{d|k} mu(d)*U(n,k/d) if k|n else 0, where U(n,k) = A047916(n,k) (1<=k<=n). %D A047918 J. E. A. Steggall, On the numbers of patterns which can be derived from certain elements, Mess. Math., 37 (1907), 56-61. %H A047918 Reinhard Zumkeller, Rows n = 1..125 of triangle, flattened %H A047918 C. L. Mallows and N. J. A. Sloane, Notes on A002618, A002619, etc. %H A047918 N. J. A. Sloane, Notes on A002618, A002619, etc. %H A047918 J. E. A. Steggall, On the numbers of patterns which can be derived from certain elements, Mess. Math., 37 (1907), 56-61. %H A047918 J. E. A. Steggall, On the numbers of patterns which can be derived from certain elements, Mess. Math., 37 (1907), 56-61. [Annotated scanned copy. Note that the scanned pages are out of order] %t A047918 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]}]; Flatten[ Table[ a[n, k], {n, 1, 12}, {k, 1, n}]] (* _Jean-François Alcover_, May 04 2012 *) %o A047918 (Haskell) %o A047918 a047918 n k = sum [a008683 (fromIntegral d) * a047916 n (k `div` d) | %o A047918 mod n k == 0, d <- [1..k], mod k d == 0] %o A047918 a047918_row n = map (a047918 n) [1..n] %o A047918 a047918_tabl = map a047918_row [1..] %o A047918 -- _Reinhard Zumkeller_, Mar 19 2014 %Y A047918 Cf. A008683, A027750, A225817. %K A047918 nonn,tabl,nice,easy %O A047918 1,2 %A A047918 _N. J. A. Sloane_ %E A047918 Offset corrected by _Reinhard Zumkeller_, Mar 19 2014 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE