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.

A062793 Moebius transform of n^n.

Original entry on oeis.org

1, 3, 26, 252, 3124, 46626, 823542, 16776960, 387420462, 9999996872, 285311670610, 8916100401348, 302875106592252, 11112006824734470, 437893890380856224, 18446744073692774400, 827240261886336764176
Offset: 1

Views

Author

Labos Elemer, Jul 19 2001

Keywords

Comments

n=4, f[4]=4^4=256, divisors={1,2,4} f[4/d]={256,4,1}, mu[d]={1,-1,0}, the sum is 256-4=252=a(4)

Crossrefs

Programs

  • PARI
    a(n) = sumdiv(n, d, d^d*moebius(n/d)); \\ Michel Marcus, Nov 04 2018

Formula

a(n) = Sum{f[n/d]*mu[d]}, where d|n and f[x]=A000312(x).