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.

A054520 Let S = {1,5,9,13,..., 4n+1, ...} and call p in S an S-prime if p>1 and the only divisors of p in S are 1 and p; sequence gives elements of S that are not S-primes.

Table of values

n a(n)
1 1
2 25
3 45
4 65
5 81
6 85
7 105
8 117
9 125
10 145
11 153
12 165
13 169
14 185
15 189
16 205
17 221
18 225
19 245
20 261
21 265
22 273
23 285
24 289
25 297
26 305
27 325
28 333
29 345
30 357
31 365
32 369
33 377
34 385
35 405
36 425
37 429
38 441
39 445
40 465
41 477
42 481
43 485
44 493
45 505
46 513
47 525
48 533
49 545
50 549
51 561
52 565
53 585

List of values

[1, 25, 45, 65, 81, 85, 105, 117, 125, 145, 153, 165, 169, 185, 189, 205, 221, 225, 245, 261, 265, 273, 285, 289, 297, 305, 325, 333, 345, 357, 365, 369, 377, 385, 405, 425, 429, 441, 445, 465, 477, 481, 485, 493, 505, 513, 525, 533, 545, 549, 561, 565, 585]

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

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