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.

A308431 For any Gaussian integer z, let f(z) = z / (1+i) when z is a multiple of 1+i and f(z) = z+1 otherwise (where i denotes the imaginary unit). a(n) gives the number of iterations of the map f, starting with n, needed to reach a cycle.

Table of values

n a(n)
0 0
1 2
2 1
3 6
4 5
5 9
6 8
7 11
8 10
9 10
10 9
11 12
12 11
13 14
14 13
15 11
16 10
17 15
18 14
19 12
20 11
21 14
22 13
23 18
24 17
25 15
26 14
27 19
28 18
29 21
30 20
31 10
32 9
33 22
34 21
35 11
36 10
37 13
38 12
39 17
40 16
41 14
42 13
43 18
44 17
45 20
46 19
47 15
48 14
49 21
50 20
51 16
52 15
53 18
54 17
55 21
56 20
57 19
58 18
59 22
60 21
61 24
62 23
63 14
64 13
65 25
66 24

List of values

[0, 2, 1, 6, 5, 9, 8, 11, 10, 10, 9, 12, 11, 14, 13, 11, 10, 15, 14, 12, 11, 14, 13, 18, 17, 15, 14, 19, 18, 21, 20, 10, 9, 22, 21, 11, 10, 13, 12, 17, 16, 14, 13, 18, 17, 20, 19, 15, 14, 21, 20, 16, 15, 18, 17, 21, 20, 19, 18, 22, 21, 24, 23, 14, 13, 25, 24]