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.

A366919 a(n) = Sum_{k=1..n} (-1)^k*k^n*floor(n/k).

Original entry on oeis.org

-1, 2, -22, 203, -2285, 33855, -609345, 12420372, -284964519, 7347342215, -209807114169, 6554034238459, -222469737401739, 8159109186320903, -321461264348047819, 13538455640979049698, -606976994365011212414, 28864017965496692865925, -1451086990386146504580735
Offset: 1

Views

Author

Chai Wah Wu, Oct 28 2023

Keywords

Crossrefs

Programs

  • Mathematica
    a[n_]:=Sum[ (-1)^k*k^n*Floor[n/k],{k,n}]; Array[a,19] (* Stefano Spezia, Oct 29 2023 *)
  • PARI
    a(n) = sum(k=1, n, (-1)^k*k^n*(n\k)); \\ Michel Marcus, Oct 29 2023
  • Python
    from math import isqrt
    from sympy import bernoulli
    def A366919(n): return ((((s:=isqrt(m:=n>>1))+1)*(bernoulli(n+1)-bernoulli(n+1,s+1))<
    				

Formula

a(n) = (-1)^n*A308313(n).
Let A(n,k) = Sum_{j=1..n} j^k * floor(n/j). Then a(n) = 2^(n+1)*A(floor(n/2),n)-A(n,n).