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.

A283531 Number of steps to return to n through a chain-addition sequence mod 10 with window of size equal to the number of digits of n.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 60, 60, 60, 12, 60, 60, 60, 60, 12, 60, 20, 12, 20, 60, 20, 60, 4, 60, 20, 60, 60, 60, 60, 60, 12, 60, 60, 60, 60, 12, 20, 60, 4, 60, 20, 60, 20, 12, 20, 60, 3, 60, 60, 60, 60, 3, 60, 60, 60, 60, 20, 60, 20, 12, 20, 60, 20, 60, 4, 60]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.