A238339 - cp's OEIS frontend

A238339 Square number array read by ascending antidiagonals: T(1,k) = 2k + 1, and T(n,k) = (2n^(k+1)-n-1)/(n-1) otherwise.

n	a(n)
0	1
1	1
2	1
3	1
4	3
5	1
6	1
7	5
8	5
9	1
10	1
11	7
12	13
13	7
14	1
15	1
16	9
17	25
18	29
19	9
20	1
21	1
22	11
23	41
24	79
25	61
26	11
27	1
28	1
29	13
30	61
31	169
32	241
33	125
34	13
35	1
36	1
37	15
38	85
39	311
40	681
41	727
42	253
43	15
44	1
45	1
46	17
47	113
48	517
49	1561
50	2729
51	2185
52	509
53	17
54	1
55	1
56	19
57	145
58	799
59	3109
60	7811
61	10921
62	6559
63	1021
64	19
65	1

[1, 1, 1, 1, 3, 1, 1, 5, 5, 1, 1, 7, 13, 7, 1, 1, 9, 25, 29, 9, 1, 1, 11, 41, 79, 61, 11, 1, 1, 13, 61, 169, 241, 125, 13, 1, 1, 15, 85, 311, 681, 727, 253, 15, 1, 1, 17, 113, 517, 1561, 2729, 2185, 509, 17, 1, 1, 19, 145, 799, 3109, 7811, 10921, 6559, 1021, 19, 1]

cp's OEIS Frontend

A238339 Square number array read by ascending antidiagonals: T(1,k) = 2k + 1, and T(n,k) = (2n^(k+1)-n-1)/(n-1) otherwise.

Table of values

List of values

cp's OEIS Frontend

A238339 Square number array read by ascending antidiagonals: T(1,k) = 2*k + 1, and T(n,k) = (2*n^(k+1)-n-1)/(n-1) otherwise.

Table of values

List of values

A238339 Square number array read by ascending antidiagonals: T(1,k) = 2k + 1, and T(n,k) = (2n^(k+1)-n-1)/(n-1) otherwise.