A064522 - cp's OEIS frontend

A064522 For an integer n with prime factorization p1p2p3* ... pn let n = (p1-1)(p2-1)(p3-1)* ... (pn-1) (A003958); sequence gives n such that n is divisible by n.

n	a(n)
1	1
2	2
3	4
4	6
5	8
6	12
7	16
8	20
9	24
10	32
11	36
12	40
13	48
14	64
15	72
16	80
17	84
18	96
19	120
20	128
21	144
22	160
23	168
24	192
25	216
26	240
27	256
28	272
29	288
30	312
31	320
32	336
33	384
34	400
35	432
36	440
37	480
38	504
39	512
40	544
41	576
42	624
43	640
44	672
45	720
46	768
47	800
48	864
49	880
50	960
51	1008
52	1024
53	1088
54	1152
55	1248
56	1280

[1, 2, 4, 6, 8, 12, 16, 20, 24, 32, 36, 40, 48, 64, 72, 80, 84, 96, 120, 128, 144, 160, 168, 192, 216, 240, 256, 272, 288, 312, 320, 336, 384, 400, 432, 440, 480, 504, 512, 544, 576, 624, 640, 672, 720, 768, 800, 864, 880, 960, 1008, 1024, 1088, 1152, 1248, 1280]

cp's OEIS Frontend

A064522 For an integer n with prime factorization p1p2p3* ... pn let n = (p1-1)(p2-1)(p3-1)* ... (pn-1) (A003958); sequence gives n such that n is divisible by n.

Table of values

List of values

cp's OEIS Frontend

A064522 For an integer n with prime factorization p1*p2*p3* ... *pn let n* = (p1-1)*(p2-1)*(p3-1)* ... *(pn-1) (A003958); sequence gives n such that n is divisible by n*.

Table of values

List of values

A064522 For an integer n with prime factorization p1p2p3* ... pn let n = (p1-1)(p2-1)(p3-1)* ... (pn-1) (A003958); sequence gives n such that n is divisible by n.