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.

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

This page as a plain text file.
%I A350223 #19 Dec 20 2021 12:22:03
%S A350223 1,1,2,1,2,1,2,0,2,2,3,0,3,2,4,-1,2,1,1,0,3,2,2,-2,2,-1,2,2,2,-1,3,-1,
%T A350223 7,2,2,0,3,2,4,-2,3,-1,1,1,0,3,5,-1,4,1,1,-2,1,1,5,-2,4,-1,4,0,3,1,1,
%U A350223 -1,2,1,3,-1,6,-1,2,-5,7,0,1,-1,4,-2,8,-5,2,4,1,3,2,4,2,-3,1,0,2,-1,3,4,0,-6,2,-1,6,3,3,1,5,-6,9
%N A350223 a(n) = Sum_{k=1..n} (-1)^(k+1) * floor((n/k)^k).
%H A350223 Seiichi Manyama, <a href="/A350223/b350223.txt">Table of n, a(n) for n = 1..5000</a>
%e A350223 a(3) = [3/1] - [(3/2)^2] + [(3/3)^3] = 3 - 2 + 1 = 2.
%e A350223 a(4) = [4/1] - [(4/2)^2] + [(4/3)^3] - [(4/4)^4] = 4 - 4 + 2 - 1 = 1.
%t A350223 a[n_] := Sum[(-1)^(k + 1)*Floor[(n/k)^k], {k, 1, n}]; Array[a, 100] (* _Amiram Eldar_, Dec 20 2021 *)
%o A350223 (PARI) a(n) = sum(k=1, n, (-1)^(k+1)*(n^k\k^k));
%Y A350223 Cf. A347415, A350224.
%K A350223 sign
%O A350223 1,3
%A A350223 _Seiichi Manyama_, Dec 20 2021