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.

A069350 Primes having no representation of the form n - A001222(n), complement of A069346.

Original entry on oeis.org

3, 11, 29, 59, 61, 71, 79, 97, 101, 137, 149, 173, 191, 193, 197, 223, 229, 269, 271, 277, 331, 349, 383, 397, 419, 421, 457, 461, 523, 569, 613, 619, 659, 661, 673, 709, 733, 757, 773, 809, 853, 857, 859, 881, 907, 997
Offset: 1

Views

Author

Reinhard Zumkeller, Mar 18 2002

Keywords

Crossrefs

Cf. A069351.

Programs

  • PARI
    is(n)=for(k=1, log(n)\log(2)+1, if(bigomega(n+k)==k, return(0))); isprime(n) \\ Charles R Greathouse IV, Dec 10 2013

A173032 Primes having no representation of the form n -+ Omega(n), where Omega is A001222.

Original entry on oeis.org

29, 61, 137, 149, 197, 349, 457, 523, 569, 619, 659, 1091, 1153, 1303, 1483, 1549, 1723, 1861, 1873, 2339, 2347, 2377, 2593, 2753, 2851, 3121, 3169, 3257, 3323, 3391, 3469, 3539, 4051, 4177, 4373, 4423, 4483, 4547, 4691, 4799, 4877, 4933, 4943, 5101, 5237
Offset: 1

Views

Author

Juri-Stepan Gerasimov, Nov 21 2010

Keywords

Comments

Intersection of A069350 and A069351.

Crossrefs

Programs

  • PARI
    is(n)=for(k=1, log(n)\log(2)+1, if(bigomega(n+k)==k||bigomega(n-k)==k, return(0))); isprime(n) \\ Charles R Greathouse IV, Dec 10 2013
Showing 1-2 of 2 results.