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.

A318995 Totally additive with a(prime(n)) = n - 1.

This page as a plain text file.
%I A318995 #13 Sep 07 2018 20:58:35
%S A318995 0,0,1,0,2,1,3,0,2,2,4,1,5,3,3,0,6,2,7,2,4,4,8,1,4,5,3,3,9,3,10,0,5,6,
%T A318995 5,2,11,7,6,2,12,4,13,4,4,8,14,1,6,4,7,5,15,3,6,3,8,9,16,3,17,10,5,0,
%U A318995 7,5,18,6,9,5,19,2,20,11,5,7,7,6,21,2,4,12
%N A318995 Totally additive with a(prime(n)) = n - 1.
%H A318995 Andrew Howroyd, <a href="/A318995/b318995.txt">Table of n, a(n) for n = 1..10000</a>
%p A318995 a:= n-> add((-1+numtheory[pi](i[1]))*i[2], i=ifactors(n)[2]):
%p A318995 seq(a(n), n=1..100);  # _Alois P. Heinz_, Sep 07 2018
%t A318995 Table[Cases[If[n==1,{},FactorInteger[n]],{p_,k_}:>(PrimePi[p]-1)*k]//Total,{n,200}]
%o A318995 (PARI) a(n)={my(f=factor(n)); sum(i=1, #f~, my([p, e]=f[i, ]); (primepi(p)-1)*e)} \\ _Andrew Howroyd_, Sep 07 2018
%Y A318995 Cf. A000040, A001222, A003963, A056239, A275024, A299757, A302242, A302243, A318994.
%K A318995 nonn
%O A318995 1,5
%A A318995 _Gus Wiseman_, Sep 07 2018