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.

A100961 For a decimal string s, let f(s) = decimal string ijk, where i = number of even digits in s, j = number of odd digits in s, k=i+j (see A171797). Start with s = decimal expansion of n; a(n) = number of applications of f needed to reach the string 123.

Table of values

n a(n)
0 2
1 2
2 2
3 2
4 2
5 2
6 2
7 2
8 2
9 2
10 2
11 3
12 2
13 3
14 2
15 3
16 2
17 3
18 2
19 3
20 3
21 2
22 3
23 2
24 3
25 2
26 3
27 2
28 3
29 2
30 2
31 3
32 2
33 3
34 2
35 3
36 2
37 3
38 2
39 3
40 3
41 2
42 3
43 2
44 3
45 2
46 3
47 2
48 3
49 2
50 2
51 3
52 2
53 3
54 2
55 3
56 2
57 3
58 2
59 3
60 3
61 2
62 3
63 2
64 3
65 2
66 3
67 2
68 3
69 2
70 2
71 3
72 2
73 3
74 2
75 3
76 2
77 3
78 2
79 3
80 3
81 2
82 3
83 2
84 3
85 2
86 3
87 2
88 3
89 2
90 2
91 3
92 2
93 3
94 2
95 3
96 2
97 3
98 2
99 3
100 2
101 1
102 2
103 1
104 2

List of values

[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1, 2, 1, 2]