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.

A251736 Corresponding values of np for A246792.

Original entry on oeis.org

1, 2, 5, 5, 8, 9, 9, 12, 12, 15, 15, 15, 20, 24, 24, 24, 24, 29, 28, 28, 28, 32, 32, 32, 30, 37, 43, 40, 41, 43, 43, 43, 39
Offset: 1

Views

Author

Robert Price, Dec 07 2014

Keywords

Comments

See A246792 for more details.

Crossrefs

Cf. A246792.

A246791 Smallest number m such that for 0 <= k < n, np(m+k) = np(m)+k, where np(t) is number of primes p with prime(t) < p < prime(t)^(1 + 1/t).

Original entry on oeis.org

1, 4, 15, 136, 2128, 15453, 479403, 1184231, 10975072, 27112368, 175600366, 2304656281, 14896902677, 59331462112
Offset: 1

Views

Author

Farideh Firoozbakht, Oct 16 2014

Keywords

Comments

np(m) = A182134(m).
According to the definition, numbers np(a(n)), np(a(n)+1), ..., np(a(n)+n-2), np(a(n)+n-1) are n consecutive numbers in ascending order.
a(15) > 10^12. - Robert Price, Nov 19 2014
See A247116 for the corresponding values of np.

Examples

			a(8) = 1184231 since np(1184231) = 17, np(1184231+1) = 18, ..., np(1184231+6) = 23, np(1184231+7) = 24 are 8 consecutive numbers and 1184231 is the smallest number with this property.
		

Crossrefs

Programs

  • Mathematica
    np[n_] := np[n] = Length[Select[Range[Prime[n]+1, Prime[n]^(1 + 1/n)], PrimeQ]]; a[1]=1; a[n_] := a[n] = (For[m = a[n-1], c = Table[np[m+k], {k,0,n-1}]; c != Range[Min[c], Max[c]], m++]; m); Do[Print[a[n]],{n, 8}]
  • PARI
    np(t) = primepi(prime(t)^(1 + 1/t)) - t;
    ok(m, n) = {for (k=0, n-1, if (np(m+k) != np(m)+k, return(0));); return (1);}
    a(n) = {m = 1; while (! ok(m, n), m++); m;} \\ Michel Marcus, Nov 25 2014

Extensions

a(9)-a(14) from Robert Price, Nov 19 2014
Showing 1-2 of 2 results.