A225640 - cp's OEIS frontend

A225640 Array A(n,k) of iterated Landau-like functions, where on the row n=0 A(0,0)=1 and A(0,k>=1)=k, and the successive rows A(n,k) give a maximum value lcm(p1,p2,...,pj,A(n-1,k)) for all partitions {p1+p2+...+pj} of k; square array A(n,k), n>=0, k>=0, read by antidiagonals.

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

[1, 1, 1, 2, 1, 1, 3, 2, 1, 1, 4, 6, 2, 1, 1, 5, 12, 6, 2, 1, 1, 6, 30, 12, 6, 2, 1, 1, 7, 30, 60, 12, 6, 2, 1, 1, 8, 84, 60, 60, 12, 6, 2, 1, 1, 9, 120, 420, 60, 60, 12, 6, 2, 1, 1, 10, 180, 840, 420, 60, 60, 12, 6, 2, 1, 1, 11, 210, 1260, 840, 420, 60, 60, 12, 6, 2, 1, 1]

cp's OEIS Frontend

A225640 Array A(n,k) of iterated Landau-like functions, where on the row n=0 A(0,0)=1 and A(0,k>=1)=k, and the successive rows A(n,k) give a maximum value lcm(p1,p2,...,pj,A(n-1,k)) for all partitions {p1+p2+...+pj} of k; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Table of values

List of values