A100253 - cp's OEIS frontend

A100253 Let j be the smallest integer for which 1+(1+1n)+(1+2n)+...+(1+jn)=k^2=s. Then a(n)=1+jn; if no such j exists, then a(n)=0.

n	a(n)
1	8
2	3
3	241
4	97
5	26
6	49
7	8
8	0
9	55
10	31
11	23
12	97
13	274
14	15
15	721
16	49
17	120
18	0
19	305
20	161
21	1681
22	89
23	24
24	577
25	1126
26	53
27	244
28	3361
29	146
30	241
31	528
32	97
33	991
34	35
35	351
36	6049
37	223
38	191
39	65521
40	1921
41	288
42	127
43	213281
44	485
45	10081
46	323
47	48
48	721
49	1520
50	0
51	2449

[8, 3, 241, 97, 26, 49, 8, 0, 55, 31, 23, 97, 274, 15, 721, 49, 120, 0, 305, 161, 1681, 89, 24, 577, 1126, 53, 244, 3361, 146, 241, 528, 97, 991, 35, 351, 6049, 223, 191, 65521, 1921, 288, 127, 213281, 485, 10081, 323, 48, 721, 1520, 0, 2449]

cp's OEIS Frontend

A100253 Let j be the smallest integer for which 1+(1+1n)+(1+2n)+...+(1+jn)=k^2=s. Then a(n)=1+jn; if no such j exists, then a(n)=0.

Table of values

List of values

cp's OEIS Frontend

A100253 Let j be the smallest integer for which 1+(1+1*n)+(1+2*n)+...+(1+j*n)=k^2=s. Then a(n)=1+j*n; if no such j exists, then a(n)=0.

Table of values

List of values

A100253 Let j be the smallest integer for which 1+(1+1n)+(1+2n)+...+(1+jn)=k^2=s. Then a(n)=1+jn; if no such j exists, then a(n)=0.