cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A167831 Largest m<=n such that no carry occurs when adding m to n in decimal arithmetic.

Table of values

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

List of values

[0, 1, 2, 3, 4, 4, 3, 2, 1, 0, 10, 11, 12, 13, 14, 14, 13, 12, 11, 10, 20, 21, 22, 23, 24, 24, 23, 22, 21, 20, 30, 31, 32, 33, 34, 34, 33, 32, 31, 30, 40, 41, 42, 43, 44, 44, 43, 42, 41, 40, 49, 48, 47, 46, 45, 44, 43, 42, 41, 40, 39, 38, 37, 36, 35, 34, 33, 32, 31, 30, 29, 28, 27]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.