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.

A096523 Solutions to A096520[x]>5, that is in neighborhood with c=2^x center and r=Ceiling[Log[2^x]] more than five[6,7,8,..?] primes occur.

Original entry on oeis.org

127, 505, 573, 619, 670, 714, 743, 844, 963
Offset: 1

Views

Author

Labos Elemer, Jul 12 2004

Keywords

Examples

			For the first few terms, the numbers of primes in the corresponding neighborhood of 2^(a[j]) are 6, 6, 8, 6, 6, 6, 6, 7, 6.
		

Crossrefs

Programs

  • Mathematica
    {ta=Table[0, {1000}], u=1}; Do[s=Count[Table[PrimeQ[2^n+i], {i, -Ceiling[Log[2^n]//N], Ceiling[Log[2^n]//N]}], True];If[Greater[s, 5], Print[{n, s}];ta[[u]]=n;u=u+1], {n, 1, 1000}];ta

A096522 Solutions to A096520[x]=0, that is in neighborhood with c=2^x center and r=Ceiling[Log[2^x]] no prime occurs.

Original entry on oeis.org

25, 27, 34, 35, 45, 49, 59, 62, 65, 97, 99, 103, 106, 113, 120, 139, 142, 169, 176, 181, 183, 185, 186, 208, 215, 216, 223, 227, 232, 237, 256, 259, 267, 269, 293, 298, 302, 309, 332, 333, 334, 340, 349, 358, 361, 362, 364, 371, 373, 381, 387, 403, 426, 433
Offset: 1

Views

Author

Labos Elemer, Jul 12 2004

Keywords

Crossrefs

Programs

  • Mathematica
    {ta=Table[0, {1000}], u=1}; Do[s=Count[Table[PrimeQ[2^n+i], {i, -Ceiling[Log[2^n]//N], Ceiling[Log[2^n]//N]}], True];If[Equal[s, 0], Print[{n, s}];ta[[u]]=n;u=u+1], {n, 1, 1000}];ta
Showing 1-2 of 2 results.