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.

A160862 a(n) = length of period of transformation sum-digit-square: given a number m(k) define m(k+1) to be the sum of the squares of the decimal digits of m(k) and iterate until m(s) is found such that m(s)=m(k) with k Numbers repeat periodically with a period of length a(n).

Table of values

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

List of values

[1, 8, 12, 8, 11, 16, 5, 12, 11, 1, 9, 12, 2, 13, 10, 8, 12, 12, 4, 8, 11, 13, 3, 8, 10, 12, 13, 3, 9, 13, 2, 3, 12, 11, 12, 15, 8, 9, 13, 8, 13, 8, 11, 4, 14, 11, 11, 13, 4, 11, 10, 10, 12, 14, 12]

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

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