A101368 - cp's OEIS frontend

A101368 The sequence solves the following problem: find all the pairs (i,j) such that i divides 1+j+j^2 and j divides 1+i+i^2. In fact, the pairs (a(n),a(n+1)), n>0, are all the solutions.

n	a(n)
1	1
2	1
3	3
4	13
5	61
6	291
7	1393
8	6673
9	31971
10	153181
11	733933
12	3516483
13	16848481
14	80725921
15	386781123
16	1853179693
17	8879117341
18	42542407011
19	203832917713
20	976622181553
21	4679277990051
22	22419767768701
23	107419560853453
24	514678036498563
25	2465970621639361
26	11815175071698241
27	56609904736851843
28	271234348612560973

[1, 1, 3, 13, 61, 291, 1393, 6673, 31971, 153181, 733933, 3516483, 16848481, 80725921, 386781123, 1853179693, 8879117341, 42542407011, 203832917713, 976622181553, 4679277990051, 22419767768701, 107419560853453, 514678036498563, 2465970621639361, 11815175071698241, 56609904736851843, 271234348612560973]

cp's OEIS Frontend

A101368 The sequence solves the following problem: find all the pairs (i,j) such that i divides 1+j+j^2 and j divides 1+i+i^2. In fact, the pairs (a(n),a(n+1)), n>0, are all the solutions.

Table of values

List of values