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.

Showing 1-2 of 2 results.

A205668 Prime numbers that cannot be expressed as the sum of two lesser primes of twin prime pairs + 1 or two greater primes of twin prime pairs - 1.

Original entry on oeis.org

2, 3, 5, 97, 401, 787, 907, 1117
Offset: 1

Views

Author

Manuel Valdivia, Jan 30 2012

Keywords

Comments

The occurrence of a pair of twin primes in the sequence would be a counterexample to the conjecture in A134143.
There are probably no more terms. As in Goldbach's conjecture, the number of summands increases rapidly. - Charles R Greathouse IV, Jan 31 2012

Examples

			97 is here because neither 96 or 98 is the sum of two primes from the set {2, 3, 5, 7, 11, 13, 17, 19, 29, 31, 41, 43, 59, 61, 71, 73}, which are the twin primes less than 100. - _T. D. Noe_, Feb 12 2012
		

Crossrefs

Programs

  • Mathematica
    k=Insert[Select[Prime[Range[2,10^4]], PrimeQ[#-2]||PrimeQ[#+2]&], 5, 3]; u=Length@k/2; Complement[Prime[Range[4,10^4]], Select[Flatten[Join[Table[k[[2n-1]] + k[[2m-1]] + 1,{n,u}, {m,n}], Table[k[[2n]] + k[[2m]] - 1,{n,u}, {m,n}]]], PrimeQ]]
  • PARI
    lower=List();p=2;forprime(q=3,1e8,if(q-p==2,listput(lower,p));p=q)
    isk(n)=for(i=1,#lower,if(setsearch(lower,n-lower[i]),return(lower[i]));if(2*lower[i]>n,return(0)));error("ran out")
    is(n)=!isk(n-1)&&!isk(n-3) \\ Charles R Greathouse IV, Jan 31 2012

Formula

A000040(n) != A001359(j) + A001359(k) + 1 and A000040(n) != A006512(j) + A006512(k) - 1, with n>3 and j<=k.

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.

Original entry on oeis.org

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, 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, 6, 8, 16, 13, 9, 12, 6, 7, 8, 4, 16, 9, 6, 13, 10, 9, 5, 6, 6
Offset: 1

Views

Author

Pedro Caceres, Jun 10 2018

Keywords

Comments

Number of pairs i, j such that A014574(i) + A014574(j) = A014574(n) where 1 <= i <= j < n. - David A. Corneth, Aug 05 2018

Examples

			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.
		

Crossrefs

Programs

  • 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
    
  • 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

Extensions

Name changed, extended data by David A. Corneth, Aug 05 2018
Showing 1-2 of 2 results.