A348480 - cp's OEIS frontend

A348480 For numbers x_n coprime to 10 there exist infinitely many binary numbers b such that gcd(b,rev(b)) = x_n and digitsum(b) = x_n. a(n) is the smallest b converted to decimal that satisfies this constraint.

n	a(n)
1	1
2	11
3	4399137296449
4	767
5	4543829
6	302306413101798081695809
7	1041919
8	4120511
9	119471087
10	92239871
11	461373439
12	3221191679
13	25098711039
14	5864072675327
15	2642508222647189060948556167549513
16	20016007615544303
17	208836273045503
18	70085007900671
19	985162418485119

[1, 11, 4399137296449, 767, 4543829, 302306413101798081695809, 1041919, 4120511, 119471087, 92239871, 461373439, 3221191679, 25098711039, 5864072675327, 2642508222647189060948556167549513, 20016007615544303, 208836273045503, 70085007900671, 985162418485119]

cp's OEIS Frontend

A348480 For numbers x_n coprime to 10 there exist infinitely many binary numbers b such that gcd(b,rev(b)) = x_n and digitsum(b) = x_n. a(n) is the smallest b converted to decimal that satisfies this constraint.

Table of values

List of values