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.

A097373 Numbers n such that there are no primes 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 zeros are located in A098598.

Table of values

n a(n)
1 40
2 44
3 46
4 48
5 60
6 64
7 66
8 68
9 69
10 80
11 84
12 86
13 88
14 90
15 96
16 99
17 194
18 400
19 404
20 406
21 408
22 440
23 444
24 446
25 448
26 460
27 464
28 466
29 468
30 480
31 484
32 486
33 488
34 600
35 604
36 606
37 608
38 609
39 640
40 644
41 646
42 648
43 660
44 664
45 666
46 668
47 669
48 680
49 684
50 686
51 688
52 690
53 696
54 699
55 800

List of values

[40, 44, 46, 48, 60, 64, 66, 68, 69, 80, 84, 86, 88, 90, 96, 99, 194, 400, 404, 406, 408, 440, 444, 446, 448, 460, 464, 466, 468, 480, 484, 486, 488, 600, 604, 606, 608, 609, 640, 644, 646, 648, 660, 664, 666, 668, 669, 680, 684, 686, 688, 690, 696, 699, 800]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.