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.

A375011 a(n) = A373738(n) - A008479(n).

This page as a plain text file.
%I A375011 #20 Aug 16 2024 23:14:50
%S A375011 0,1,1,1,1,3,1,1,1,4,1,5,1,4,3,1,1,6,1,5,3,5,1,6,1,5,1,5,1,11,1,1,4,5,
%T A375011 3,8,1,5,4,7,1,12,1,6,5,6,1,8,1,7,4,6,1,8,3,7,4,6,1,17,1,6,5,1,3,14,1,
%U A375011 6,4,12,1,9,1,6,6,6,3,15,1,8,1,7,1,18,3
%N A375011 a(n) = A373738(n) - A008479(n).
%H A375011 Michael De Vlieger, <a href="/A375011/b375011.txt">Table of n, a(n) for n = 1..10000</a>
%H A375011 Michael De Vlieger, <a href="/A375011/a375011.png">Log log scatterplot of a(n)</a>, n = 2..2^20, ignoring a(1) = 0, with a color code where red indicates omega(n) = 2, gold omega(n) = 3, lime green = omega(n) = 4, spring green = omega(n) = 5, and blue = omega(n) = 6, where omega = A001221.
%F A375011 a(1) = 0; a(k) = 1 for k in A246655.
%t A375011 {0}~Join~Table[facs = FactorInteger[n][[All, 1]]; r = Times @@ facs;
%t A375011   Floor[(1/PrimeNu[n]!)*Times @@ Map[Log[#, n] + 1 &, facs]] -
%t A375011     Count[Range[n], _?(Times @@ FactorInteger[#][[All, 1]] == r &)], {n, 2, 120}]
%Y A375011 Cf. A001221, A008479, A246655, A372192, A373738.
%K A375011 nonn
%O A375011 1,6
%A A375011 _Michael De Vlieger_, Aug 14 2024