A284815 - cp's OEIS frontend

A284815 Least number k such that k mod (2, 3, 4, ... , n+1) = (d_n, d_n-1, ..., d_1), where d_1 , d_2, ..., d_n are the digits of k, with MSD(k) = d_1 and LSD(k) = d_n. 0 if such a number does not exist.

n	a(n)
1	1
2	10
3	0
4	1101
5	11311
6	340210
7	4620020
8	12040210
9	151651121
10	1135531101
11	0
12	894105331101
13	0
14	15379177511311
15	0
16	0
17	0
18	0
19	0
20	0
21	0
22	0
23	0
24	0
25	0
26	0
27	0
28	0
29	0
30	0
31	0
32	0
33	0
34	0
35	0
36	0
37	0
38	0
39	0
40	0
41	0
42	0
43	0
44	0
45	0
46	0
47	0
48	0
49	0
50	0

[1, 10, 0, 1101, 11311, 340210, 4620020, 12040210, 151651121, 1135531101, 0, 894105331101, 0, 15379177511311, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]

cp's OEIS Frontend

A284815 Least number k such that k mod (2, 3, 4, ... , n+1) = (d_n, d_n-1, ..., d_1), where d_1 , d_2, ..., d_n are the digits of k, with MSD(k) = d_1 and LSD(k) = d_n. 0 if such a number does not exist.

Table of values

List of values