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.

A352751 Modified Sisyphus function of order 4: a(n) is the concatenation of (number of digits of n)(number digits of n congruent to 0 modulo 4)(number of digits of n congruent to 1 modulo 4)(number of digits of n congruent to 2 modulo 4)(number of digits of n congruent to 3 modulo 4).

Table of values

n a(n)
0 11000
1 10100
2 10010
3 10001
4 11000
5 10100
6 10010
7 10001
8 11000
9 10100
10 21100
11 20200
12 20110
13 20101
14 21100
15 20200
16 20110
17 20101
18 21100
19 20200
20 21010
21 20110
22 20020
23 20011
24 21010
25 20110
26 20020
27 20011
28 21010
29 20110
30 21001
31 20101
32 20011
33 20002
34 21001
35 20101
36 20011
37 20002
38 21001
39 20101
40 22000
41 21100
42 21010

List of values

[11000, 10100, 10010, 10001, 11000, 10100, 10010, 10001, 11000, 10100, 21100, 20200, 20110, 20101, 21100, 20200, 20110, 20101, 21100, 20200, 21010, 20110, 20020, 20011, 21010, 20110, 20020, 20011, 21010, 20110, 21001, 20101, 20011, 20002, 21001, 20101, 20011, 20002, 21001, 20101, 22000, 21100, 21010]