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.

A072107 a(n) = Sum_{k=1..n} A014963(k).

This page as a plain text file.
%I A072107 #17 Jan 30 2025 02:29:02
%S A072107 1,3,6,8,13,14,21,23,26,27,38,39,52,53,54,56,73,74,93,94,95,96,119,
%T A072107 120,125,126,129,130,159,160,191,193,194,195,196,197,234,235,236,237,
%U A072107 278,279,322,323,324,325,372,373,380,381,382,383,436,437,438,439,440,441
%N A072107 a(n) = Sum_{k=1..n} A014963(k).
%C A072107 Is there an expression for lim_{n -> infinity} a(n)/n^2?
%C A072107 Equals row sums of triangle A140582. - _Gary W. Adamson_, May 17 2008
%H A072107 Amiram Eldar, <a href="/A072107/b072107.txt">Table of n, a(n) for n = 1..10000</a>
%H A072107 Vaclav Kotesovec, <a href="/A072107/a072107.jpg">Plot of a(n) / (n^2/log(n)) for n = 1..10^9</a>
%F A072107 Conjecture: a(n) ~ n^2/(2*log(n)). - _Vaclav Kotesovec_, Jan 30 2025
%t A072107 Accumulate[Table[Exp[MangoldtLambda[n]], {n, 1, 60}]] (* _Amiram Eldar_, May 05 2022 *)
%o A072107 (PARI) for(n=2,100,print1(1+sum(k=2,n,if(if(omega(k)-1,0,1)*component(component(factor(k),1),1),if(omega(k)-1,0,1)*component(component(factor(k),1),1),1)),","))
%Y A072107 Cf. A140582, A014963.
%K A072107 easy,nonn
%O A072107 1,2
%A A072107 _Benoit Cloitre_, Jun 19 2002