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!)
A305825 Number of different ways that a number between two members of a twin prime pair can be expressed as a sum of two smaller such numbers. 0

%I #38 Jul 11 2019 01:50:53

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

%T 6,4,4,6,7,8,3,6,3,9,8,6,7,5,8,4,1,5,6,3,7,1,6,6,4,8,1,5,5,8,9,11,10,

%U 6,8,16,13,9,12,6,7,8,4,16,9,6,13,10,9,5,6,6

%N Number of different ways that a number between two members of a twin prime pair can be expressed as a sum of two smaller such numbers.

%C Number of pairs i, j such that A014574(i) + A014574(j) = A014574(n) where 1 <= i <= j < n. - _David A. Corneth_, Aug 05 2018

%e a(8)=2 because the 8th isolated composite number is 72 = 60 + 12 and 42 + 30 with (12,30,42,60) all isolated composite numbers.

%o (PARI) lista(nn) = {my(vc = select(x->(isprime(x-1) && isprime(x+1)), [1..nn])); for (n=1, #vc, nb = 0; for (j=1, n, for (k=j+1, n, if (vc[j]+vc[k] == vc[n], nb++));); print1(nb, ", "););} \\ _Michel Marcus_, Jul 05 2018

%o (PARI) first(n) = {my(isolated = List(), isomap = Map, res = vector(n), k, q = 3); forprime(p = 5, , if(p - q == 2, listput(isolated, q+1); mapput(isomap, q+1, #isolated); if(#isolated == n, break)); q = p); for(i = 1, #isolated, for(j = 1, i - 1, diff = isolated[i] - isolated[j]; if(diff < isolated[j], if( mapisdefined(isomap, diff, &k), res[i]++), next(1)))); res} \\ _David A. Corneth_, Aug 05 2018

%Y Cf. A014574, A134143.

%K nonn

%O 1,8

%A _Pedro Caceres_, Jun 10 2018

%E Name changed, extended data by _David A. Corneth_, Aug 05 2018

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 May 14 23:22 EDT 2024. Contains 372535 sequences. (Running on oeis4.)