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.

A277891 a(n) = number of odd numbers encountered before reaching (n^2)-1 when starting from k = ((n+1)^2)-1 and iterating map k -> k - A002828(k).

Table of values

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

List of values

[1, 0, 2, 1, 2, 2, 4, 2, 4, 3, 4, 4, 6, 5, 7, 6, 5, 6, 7, 7, 6, 6, 11, 9, 9, 9, 12, 9, 10, 9, 11, 11, 12, 11, 14, 13, 15, 12, 14, 14, 16, 14, 15, 13, 15, 17, 18, 17, 14, 17, 19, 18, 20, 17, 22, 19, 22, 20, 20, 22, 20, 22, 23, 22, 24, 25, 22, 22, 25, 26, 26, 25, 28, 24, 30, 26, 28, 29, 27, 27, 28, 32, 29, 28, 32, 32, 29, 31, 30, 29, 35, 33, 32, 32, 35, 34, 35, 36]