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.

A097208 a(n) is the least k such that A098598(k) = n.

Original entry on oeis.org

40, 24, 19, 17, 16, 10, 23, 21, 92, 313, 155, 551, 2575, 757, 13537, 5525, 35133, 33953, 332975, 355573, 3157535, 1571573, 2732737, 3775555, 5737571, 37332775
Offset: 0

Views

Author

Jason Earls, Sep 17 2004

Keywords

Comments

a(27) = 75787577. No more terms < 10^8. - David Wasserman, Dec 27 2007

Examples

			a(3)=17 because it is the least number that contains 3 primes in the sequence 1,7,8,15,23,38,61,99,160,259.
		

Crossrefs

Cf. A098598.

Programs

  • Mathematica
    f[n_] := Block[{id = IntegerDigits[n], t = Floor[ Log[10, n] + 1], b}, Do[ b[i] = id[[i]], {i, t}]; b[i_] := b[i] = Plus @@ Table[b[i - j], {j, t}]; k = t + 1; While[b[k] < n^2, k++ ]; Count[ PrimeQ[ Table[b[i], {i, k - 1}]], True]]; t = Table[0, {50}]; Do[c = f[n]; If[ t[[c + 1]] == 0, t[[c + 1]] = n; Print[c, " = ", n]], {n, 10, 12000000}]; t (* Robert G. Wilson v, Oct 07 2004 *)

Extensions

Corrected and extended by Robert G. Wilson v, Oct 07 2004
a(25), a(27) and better definition from David Wasserman, Dec 27 2007