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.
%I A097377 #12 Feb 16 2025 08:32:54
%S A097377 2,3,4,5,6,7,8,5,10,11,12,13,14,15,16,5,18,19,20,21,22,23,24,13,26,27,
%T A097377 10,29,30,31,32,5,34,35,36,37,38,39,40,21,42,43,44,45,46,47,48,13,50,
%U A097377 51,52,53,54,19,56,29,58,59,60,61,62,63,64,5,66,67,68,69,70,71,72,37,74,75
%N A097377 a(n) = CubeFreeKernel(n) + 1.
%H A097377 Amiram Eldar, <a href="/A097377/b097377.txt">Table of n, a(n) for n = 1..10000</a>
%H A097377 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Cubefree.html">Cubefree</a>.
%F A097377 a(n) = A007948(n) + 1.
%F A097377 Dirichlet g.f.: zeta(s) * (1 + Product_{p prime} (1 + 1/p^(s-1) - 1/p^s + 1/p^(2*s-2) - 1/p^(2*s-1)). - _Amiram Eldar_, Feb 01 2024
%t A097377 f[p_, e_] := p^Min[e, 2]; a[1] = 2; a[n_] := 1 + Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* _Amiram Eldar_, Feb 01 2024 *)
%o A097377 (PARI) a(n) = {my(f = factor(n)); 1 + prod(i = 1, #f~, f[i, 1]^min(f[i, 2], 2));} \\ _Amiram Eldar_, Feb 01 2024
%Y A097377 Cf. A097380, A004709.
%K A097377 nonn
%O A097377 1,1
%A A097377 _Reinhard Zumkeller_, Aug 11 2004