A100254 - cp's OEIS frontend

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

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

[7, 1, 80, 24, 5, 8, 1, 0, 6, 3, 2, 8, 21, 1, 48, 3, 7, 0, 16, 8, 80, 4, 1, 24, 45, 2, 9, 120, 5, 8, 17, 3, 30, 1, 10, 168, 6, 5, 1680, 48, 7, 3, 4960, 11, 224, 7, 1, 15, 31, 0, 48, 24, 16, 12, 288, 8, 48, 6, 26, 80, 117, 1, 136160, 195, 13, 3, 9, 840, 1520, 24, 49, 8, 70, 2, 1680]

cp's OEIS Frontend

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

Table of values

List of values

cp's OEIS Frontend

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

Table of values

List of values

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