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.

A230855 Numbers n such that m + (sum of digits in base-3 representation of m) = n has exactly three solutions.

Table of values

n a(n)
1 28
2 32
3 56
4 60
5 84
6 86
7 110
8 114
9 138
10 142
11 166
12 168
13 192
14 196
15 220
16 224
17 244
18 252
19 272
20 276
21 300
22 304
23 328
24 330
25 354
26 358
27 382
28 386
29 410
30 412
31 436
32 440
33 464
34 468
35 488
36 496
37 516
38 520
39 544
40 548
41 572
42 574
43 598
44 602
45 626
46 630
47 654
48 656
49 680
50 684
51 708
52 712
53 730
54 732
55 734
56 736
57 738
58 740
59 758
60 762

List of values

[28, 32, 56, 60, 84, 86, 110, 114, 138, 142, 166, 168, 192, 196, 220, 224, 244, 252, 272, 276, 300, 304, 328, 330, 354, 358, 382, 386, 410, 412, 436, 440, 464, 468, 488, 496, 516, 520, 544, 548, 572, 574, 598, 602, 626, 630, 654, 656, 680, 684, 708, 712, 730, 732, 734, 736, 738, 740, 758, 762]

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

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