STATUS
editing
approved
The OEIS is supported by the many generous donors to the OEIS Foundation.
editing
approved
R[k] = k**n # Chancing Changing this to R[k] = (n + 1)**k generates A344499.
approved
editing
editing
approved
The array rows are recursively generated by applying the Akiyama-Tanigawa algorithm to the powers (see the Python implementation below). So In this way the array is becomes the image of A004248 under the AT-transformation executed row by rowwhen applied to the rows of A004248. This makes the array closely linked to A344499, which is generated in the same way, but applied to the columns of A004248.
R[k] = k**n # Chancing this to R[k] = (n + 1)**k generates A344499.
approved
editing
proposed
approved
editing
proposed
Don Knuth, <a href="http://cs.stanford.edu/~knuth/papers/poly-Bernoulli.pdf">Parades and poly-Bernoulli bijections</a>, Mar 31 2024. See (16.2). [broken link]
approved
editing
proposed
approved
editing
proposed
Don Knuth, <a href="http://cs.stanford.edu/~knuth/papers/poly-Bernoulli.pdf">Parades and poly-Bernoulli bijections</a>, Mar 31 2024. See (16.2). [broken link]
approved
editing