A064518 - cp's OEIS frontend

A064518 For an integer n with prime factorization p_1p_2p_3* ... p_m let n = (p_1+1)(p_2+1)(p_3+1)* ... (p_m+1); sequence gives n such that n* is divisible by n, ordered by increasing value of n.

n	a(n)
1	1
2	12
3	36
4	144
5	432
6	1296
7	1728
8	5184
9	15552
10	20736
11	46656
12	62208
13	186624
14	248832
15	559872
16	746496
17	1679616
18	2239488
19	2985984
20	6718464
21	8957952
22	20155392
23	26873856
24	60466176
25	35831808
26	80621568
27	107495424
28	241864704
29	322486272

[1, 12, 36, 144, 432, 1296, 1728, 5184, 15552, 20736, 46656, 62208, 186624, 248832, 559872, 746496, 1679616, 2239488, 2985984, 6718464, 8957952, 20155392, 26873856, 60466176, 35831808, 80621568, 107495424, 241864704, 322486272]

cp's OEIS Frontend

A064518 For an integer n with prime factorization p_1p_2p_3* ... p_m let n = (p_1+1)(p_2+1)(p_3+1)* ... (p_m+1); sequence gives n such that n* is divisible by n, ordered by increasing value of n.

Table of values

List of values

cp's OEIS Frontend

A064518 For an integer n with prime factorization p_1*p_2*p_3* ... *p_m let n* = (p_1+1)*(p_2+1)*(p_3+1)* ... *(p_m+1); sequence gives n* such that n* is divisible by n, ordered by increasing value of n.

Table of values

List of values

A064518 For an integer n with prime factorization p_1p_2p_3* ... p_m let n = (p_1+1)(p_2+1)(p_3+1)* ... (p_m+1); sequence gives n such that n* is divisible by n, ordered by increasing value of n.