A331787 - cp's OEIS frontend

A331787 T(b,n) is the largest m such that there exists N such that none 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	0
3	0
4	2
5	0
6	1
7	6
8	0
9	2
10	4
11	14
12	0
13	1
14	2
15	7
16	30
17	0
18	2
19	4
20	6
21	16
22	62
23	0
24	1
25	4
26	3
27	14
28	25
29	126
30	0
31	2
32	2
33	6
34	8
35	14
36	52
37	254
38	0
39	1
40	4
41	5
42	4
43	13
44	30
45	79
46	510
47	0
48	2
49	4
50	6
51	8
52	10
53	28
54	62
55	160
56	1022
57	0
58	1
59	2
60	3
61	8
62	5
63	22
64	23
65	62
66	241
67	2046
68	0
69	2
70	4
71	6
72	8
73	10
74	12
75	34
76	48
77	126
78	484
79	4094

[0, 0, 2, 0, 1, 6, 0, 2, 4, 14, 0, 1, 2, 7, 30, 0, 2, 4, 6, 16, 62, 0, 1, 4, 3, 14, 25, 126, 0, 2, 2, 6, 8, 14, 52, 254, 0, 1, 4, 5, 4, 13, 30, 79, 510, 0, 2, 4, 6, 8, 10, 28, 62, 160, 1022, 0, 1, 2, 3, 8, 5, 22, 23, 62, 241, 2046, 0, 2, 4, 6, 8, 10, 12, 34, 48, 126, 484, 4094]

cp's OEIS Frontend

A331787 T(b,n) is the largest m such that there exists N such that none 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