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.

A069812 a(n) = Sum_{k=1..n} (bigomega(k)-omega(k)).

This page as a plain text file.
%I A069812 #18 Sep 17 2024 04:03:59
%S A069812 0,0,0,1,1,1,1,3,4,4,4,5,5,5,5,8,8,9,9,10,10,10,10,12,13,13,15,16,16,
%T A069812 16,16,20,20,20,20,22,22,22,22,24,24,24,24,25,26,26,26,29,30,31,31,32,
%U A069812 32,34,34,36,36,36,36,37,37,37,38,43,43,43,43,44,44,44,44,47,47,47,48
%N A069812 a(n) = Sum_{k=1..n} (bigomega(k)-omega(k)).
%H A069812 Vaclav Kotesovec, <a href="/A069812/b069812.txt">Table of n, a(n) for n = 1..10000</a>
%F A069812 a(n) ~ A136141 * n, where A136141 = 0.773156669... - _Vaclav Kotesovec_, Sep 01 2019
%F A069812 G.f.: (1/(1 - x)) * Sum_{p prime, k>=2} x^(p^k)/(1 - x^(p^k)). - _Ilya Gutkovskiy_, Sep 03 2019
%t A069812 Accumulate[Table[PrimeOmega[n]-PrimeNu[n],{n,80}]] (* _Harvey P. Dale_, Oct 10 2015 *)
%o A069812 (PARI) lista(nmax) = {my(s = 0, e); for(n = 1, nmax, e = factor(n)[, 2]; s += vecsum(e) - #e; print1(s, ", "));} \\ _Amiram Eldar_, Sep 17 2024
%Y A069812 Cf. A001221, A001222, A046660, A136141.
%K A069812 easy,nonn
%O A069812 1,8
%A A069812 _Benoit Cloitre_, Apr 30 2002