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.

A097376 Numbers n such that there is exactly one prime in a sequence formed from the t digits of n where the latter terms are given by rule b(i)=sum of t previous terms and the primes are counted from initial t digits up to the largest term < n^2; where ones are located in A098598.

Original entry on oeis.org

24, 26, 28, 36, 39, 42, 62, 63, 82, 93, 116, 148, 149, 168, 189, 204, 206, 208, 240, 244, 246, 248, 260, 264, 266, 268, 280, 284, 286, 288, 306, 309, 360, 366, 369, 384, 390, 396, 399, 402, 411, 414, 419, 420, 424, 426, 428, 441, 442, 462, 465, 482, 491, 498
Offset: 1

Views

Author

Jason Earls, Sep 18 2004

Keywords

Examples

			148 is in the sequence because
1,4,8,13,25,46,84,155,285,524,964,1773,3261,5998,11032,20291 contains one prime.
		

Crossrefs

Cf. A098598.