STATUS
proposed
approved
The OEIS is supported by the many generous donors to the OEIS Foundation.
Revision History for A054631
(Bold, blue-underlined text is an addition; faded, red-underlined text is aShowing entries 1-10 | older changes
Triangle read by rows: row n (n >= 1) contains the numbers T(n,k) = Sum_{d|n} phi(d)*k^(n/d)/n, for k=1..n.
(history; published version)
(history; published version)
STATUS
editing
proposed
LINKS
Seiichi Manyama, <a href="/A054631/b054631.txt">Rows n = 1..140, flattened</a>
STATUS
approved
editing
STATUS
proposed
approved
STATUS
editing
proposed
LINKS
Wikipedia, <a href="https://en.wikipedia.org/wiki/Necklace_(combinatorics)">Necklace (combinatorics)</a>
<a href="https://en.wikipedia.org/wiki/Necklace_(combinatorics)">Necklace (combinatorics)</a>
STATUS
proposed
editing
STATUS
editing
proposed
LINKS
Seiichi Manyama, <a href="/A054631/b054631.txt">Table of n, a(n) for Rows n = 1..9870<140, flattened/a>
LINKS
Seiichi Manyama, <a href="/A054631/b054631.txt">Table of n, a(n) for n = 1..9870</a>
PROG
(PARI) T(n, k) = sumdiv(n, d, eulerphi(d)*k^(n/d))/n; \\ Seiichi Manyama, Mar 10 2021(PARI) T(n, k) = sum(j=1, n, k^gcd(j, n))/n; \\ _Seiichi Manyama_, Mar 10 2021
(PARI) T(n, k) = sum(j=1, n, k^gcd(j, n))/n; \\ Seiichi Manyama, Mar 10 2021