A061904 - cp's OEIS frontend

A061904 Numbers n such that the iterative cycle: n -> sum of digits of n^2 has only one distinct element.

n	a(n)
1	1
2	3
3	6
4	9
5	10
6	12
7	15
8	18
9	21
10	30
11	39
12	45
13	48
14	51
15	60
16	90
17	100
18	102
19	105
20	111
21	120
22	150
23	180
24	201
25	210
26	249
27	300
28	318
29	321
30	348
31	351
32	390
33	450
34	480
35	501
36	510
37	549
38	600
39	900
40	1000
41	1002
42	1005
43	1011
44	1020
45	1050
46	1101
47	1110
48	1149
49	1200
50	1500
51	1761
52	1800
53	2001

[1, 3, 6, 9, 10, 12, 15, 18, 21, 30, 39, 45, 48, 51, 60, 90, 100, 102, 105, 111, 120, 150, 180, 201, 210, 249, 300, 318, 321, 348, 351, 390, 450, 480, 501, 510, 549, 600, 900, 1000, 1002, 1005, 1011, 1020, 1050, 1101, 1110, 1149, 1200, 1500, 1761, 1800, 2001]

cp's OEIS Frontend

A061904 Numbers n such that the iterative cycle: n -> sum of digits of n^2 has only one distinct element.

Table of values

List of values