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.

A097380 Numbers m such that 1+CubeFreeKernel(m) is prime.

This page as a plain text file.
%I A097380 #12 Feb 01 2024 01:48:40
%S A097380 1,2,4,6,8,10,12,16,18,22,24,28,30,32,36,42,46,48,52,54,56,58,60,64,
%T A097380 66,70,72,78,82,96,100,102,104,106,108,112,120,126,128,130,138,144,
%U A097380 148,150,156,162,166,172,178,180,190,192,196,198,200,208,210,216,222,224,226
%N A097380 Numbers m such that 1+CubeFreeKernel(m) is prime.
%H A097380 Amiram Eldar, <a href="/A097380/b097380.txt">Table of n, a(n) for n = 1..10000</a>
%F A097380 A097377(a(n)) = A007948(a(n))+1 is prime.
%e A097380 m = 216 = (2*3)^3 -> A097377(216) = 1+(2*3)^2 = 37 = A000040(12), therefore 216 is a term.
%t A097380 f[p_, e_] := p^Min[e, 2]; s[1] = 2; s[n_] := 1 + Times @@ f @@@ FactorInteger[n]; Select[Range[230], PrimeQ[s[#]] &] (* _Amiram Eldar_, Feb 01 2024 *)
%o A097380 (PARI) is(n) = {my(f = factor(n)); isprime(1 + prod(i = 1, #f~, f[i, 1]^min(f[i, 2], 2)));} \\ _Amiram Eldar_, Feb 01 2024
%Y A097380 Cf. A007948, A089189, A097377, A097379, A097381.
%K A097380 nonn
%O A097380 1,2
%A A097380 _Reinhard Zumkeller_, Aug 11 2004