The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A072963 In prime factorization of n replace all single (i.e., non-twin) primes with 1. 2

%I #12 Jan 10 2020 05:23:48

%S 1,1,3,1,5,3,7,1,9,5,11,3,13,7,15,1,17,9,19,5,21,11,1,3,25,13,27,7,29,

%T 15,31,1,33,17,35,9,1,19,39,5,41,21,43,11,45,1,1,3,49,25,51,13,1,27,

%U 55,7,57,29,59,15,61,31,63,1,65,33,1,17,3,35,71,9,73,1,75,19,77,39,1,5,81

%N In prime factorization of n replace all single (i.e., non-twin) primes with 1.

%C a(a(n)) = a(n).

%H Amiram Eldar, <a href="/A072963/b072963.txt">Table of n, a(n) for n = 1..10000</a>

%F Multiplicative with a(p) = (if p+2 or p-2 is prime then p else 1), p prime.

%e a(92) = a(2*2*23) = 1; a(93) = a(3*31) = 3*31 = 93.

%t f[p_, e_] := If[!Or @@ PrimeQ[p + {-2, 2}], 1, p^e]; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 81] (* _Amiram Eldar_, Jan 10 2020 *)

%Y Cf. A007510, A000040.

%K nonn,mult

%O 1,3

%A _Reinhard Zumkeller_, Aug 20 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 1 10:14 EDT 2024. Contains 373016 sequences. (Running on oeis4.)