A331789 - cp's OEIS frontend

A331789 T(b,n) is the smallest m such that for any N, at least one of S(N), S(N+1), ..., S(N+m-1) is divisible by n, where S(N) is the sum of digits of N in base b. Square array read by ascending antidiagonals.

n	a(n)
2	1
3	1
4	3
5	1
6	2
7	7
8	1
9	3
10	5
11	15
12	1
13	2
14	3
15	8
16	31
17	1
18	3
19	5
20	7
21	17
22	63
23	1
24	2
25	5
26	4
27	15
28	26
29	127
30	1
31	3
32	3
33	7
34	9
35	15
36	53
37	255
38	1
39	2
40	5
41	6
42	5
43	14
44	31
45	80
46	511
47	1
48	3
49	5
50	7
51	9
52	11
53	29
54	63
55	161
56	1023
57	1
58	2
59	3
60	4
61	9
62	6
63	23
64	24
65	63
66	242
67	2047
68	1
69	3
70	5
71	7
72	9
73	11
74	13
75	35
76	49
77	127
78	485
79	4095

[1, 1, 3, 1, 2, 7, 1, 3, 5, 15, 1, 2, 3, 8, 31, 1, 3, 5, 7, 17, 63, 1, 2, 5, 4, 15, 26, 127, 1, 3, 3, 7, 9, 15, 53, 255, 1, 2, 5, 6, 5, 14, 31, 80, 511, 1, 3, 5, 7, 9, 11, 29, 63, 161, 1023, 1, 2, 3, 4, 9, 6, 23, 24, 63, 242, 2047, 1, 3, 5, 7, 9, 11, 13, 35, 49, 127, 485, 4095]

cp's OEIS Frontend

A331789 T(b,n) is the smallest m such that for any N, at least one of S(N), S(N+1), ..., S(N+m-1) is divisible by n, where S(N) is the sum of digits of N in base b. Square array read by ascending antidiagonals.

Table of values

List of values