login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Number of divisors of 2n that are the average of a pair of twin primes.
1

%I #17 Jun 03 2024 03:48:38

%S 0,1,1,1,0,3,0,1,2,1,0,3,0,1,2,1,0,4,0,1,2,1,0,3,0,1,2,1,0,5,0,1,1,1,

%T 0,5,0,1,1,1,0,4,0,1,3,1,0,3,0,1,2,1,0,5,0,1,1,1,0,5,0,1,3,1,0,3,0,1,

%U 2,1,0,5,0,1,3,1,0,3,0,1,2,1,0,4,0,1,1,1,0,7,0

%N Number of divisors of 2n that are the average of a pair of twin primes.

%H Robert Israel, <a href="/A339558/b339558.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) = Sum_{d|(2*n)} c(d+1) * c(d-1), where c is the prime characteristic (A010051).

%F Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = 2 * A241560 = 1.857671... . - _Amiram Eldar_, Jun 03 2024

%e a(6) = 3; There are 3 divisors of 2*6 = 12 that are the average of twin primes, namely 4, 6 and 12.

%p f:= proc(n) nops(select(t -> isprime(t-1) and isprime(t+1), numtheory:-divisors(2*n))) end proc:

%p map(f, [$1..100]); # _Robert Israel_, Jan 06 2021

%t Table[Sum[(PrimePi[2n/i + 1] - PrimePi[2n/i]) (PrimePi[2n/i - 1] - PrimePi[2n/i - 2]) (1 - Ceiling[2n/i] + Floor[2n/i]), {i, 2n}], {n, 100}]

%o (PARI) a(n) = sumdiv(2*n, d, (d>1) && (bigomega(d^2-1)==2)); \\ _Michel Marcus_, Dec 16 2020

%o (PARI) a(n) = sumdiv(2*n, d, d > 1 && isprime(d-1) && isprime(d+1)); \\ _Amiram Eldar_, Jun 03 2024

%Y Cf. A000005, A010051, A014574, A241560, A284203.

%K easy,nonn

%O 1,6

%A _Wesley Ivan Hurt_, Dec 08 2020