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.

A096024 Numbers n such that (n+j) mod (2+j) = 1 for j from 0 to 5 and (n+6) mod 8 <> 1.

Table of values

n a(n)
1 423
2 1263
3 2103
4 2943
5 3783
6 4623
7 5463
8 6303
9 7143
10 7983
11 8823
12 9663
13 10503
14 11343
15 12183
16 13023
17 13863
18 14703
19 15543
20 16383
21 17223
22 18063
23 18903
24 19743
25 20583
26 21423
27 22263
28 23103
29 23943
30 24783
31 25623
32 26463
33 27303
34 28143
35 28983
36 29823

List of values

[423, 1263, 2103, 2943, 3783, 4623, 5463, 6303, 7143, 7983, 8823, 9663, 10503, 11343, 12183, 13023, 13863, 14703, 15543, 16383, 17223, 18063, 18903, 19743, 20583, 21423, 22263, 23103, 23943, 24783, 25623, 26463, 27303, 28143, 28983, 29823]