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.

A082898 a(n) = A082895(n)/n, where A082895(n) is the closest number to sigma(n) which is divisible by n.

This page as a plain text file.
%I A082898 #9 Oct 09 2018 15:15:26
%S A082898 1,2,1,2,1,2,1,2,1,2,1,2,1,2,2,2,1,2,1,2,2,2,1,3,1,2,1,2,1,2,1,2,1,2,
%T A082898 1,3,1,2,1,2,1,2,1,2,2,2,1,3,1,2,1,2,1,2,1,2,1,2,1,3,1,2,2,2,1,2,1,2,
%U A082898 1,2,1,3,1,2,2,2,1,2,1,2,1,2,1,3,1,2,1,2,1,3,1,2,1,2,1,3,1,2,2,2
%N A082898 a(n) = A082895(n)/n, where A082895(n) is the closest number to sigma(n) which is divisible by n.
%H A082898 Antti Karttunen, <a href="/A082898/b082898.txt">Table of n, a(n) for n = 1..100000</a>
%F A082898 a(n) = floor[(floor(n/2)+sigma[n])/n], sigma() = A000203().
%t A082898 Table[Floor[(Floor[n/2]+DivisorSigma[1, n])/n], {n, 1, 100}]
%o A082898 (PARI) A082898(n) = { my(s=sigma(n), a = ((s\n)*n), b = (1+(s\n))*n); if((b-s) <= abs(a-s), b, a)/n; }; \\ _Antti Karttunen_, Oct 09 2018
%Y A082898 Cf. A082893, A082894, A082895, A082901.
%K A082898 nonn
%O A082898 1,2
%A A082898 _Labos Elemer_, Apr 22 2003