A106229 - cp's OEIS frontend

A106229 Least j > 1 for n > 0 such that j^2 = (n^2 + 1)(k^2) + (n^2 + 1)k + 1 where k sequence = A106230.

n	a(n)
1	5
2	19
3	11
4	35
5	79
6	149
7	251
8	391
9	575
10	809
11	1099
12	1451
13	1871
14	2365
15	2939
16	3599
17	4351
18	5201
19	6155
20	7219
21	8399
22	9701
23	11131
24	12695
25	14399
26	16249
27	18251
28	20411
29	22735
30	25229
31	27899
32	30751
33	33791
34	37025
35	40459
36	44099
37	47951
38	52021
39	56315
40	60839
41	65599
42	70601
43	75851

[5, 19, 11, 35, 79, 149, 251, 391, 575, 809, 1099, 1451, 1871, 2365, 2939, 3599, 4351, 5201, 6155, 7219, 8399, 9701, 11131, 12695, 14399, 16249, 18251, 20411, 22735, 25229, 27899, 30751, 33791, 37025, 40459, 44099, 47951, 52021, 56315, 60839, 65599, 70601, 75851]

cp's OEIS Frontend

A106229 Least j > 1 for n > 0 such that j^2 = (n^2 + 1)(k^2) + (n^2 + 1)k + 1 where k sequence = A106230.

Table of values

List of values

cp's OEIS Frontend

A106229 Least j > 1 for n > 0 such that j^2 = (n^2 + 1)*(k^2) + (n^2 + 1)*k + 1 where k sequence = A106230.

Table of values

List of values

A106229 Least j > 1 for n > 0 such that j^2 = (n^2 + 1)(k^2) + (n^2 + 1)k + 1 where k sequence = A106230.