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.

A077495 a(n) = smallest k such that the digit sum of 8k is n.

Table of values

n a(n)
0 0
1 125
2 25
3 15
4 5
5 4
6 3
7 2
8 1
9 9
10 8
11 7
12 6
13 23
14 22
15 12
16 11
17 37
18 36
19 62
20 61
21 87
22 86
23 112
24 111
25 236
26 361
27 486
28 611
29 736
30 861
31 986
32 1111
33 1236
34 2486
35 3736
36 4986
37 6236
38 7486
39 8736
40 9986
41 11236
42 12486
43 24986
44 37486
45 49986
46 62486
47 74986
48 87486
49 99986
50 112486
51 124986

List of values

[0, 125, 25, 15, 5, 4, 3, 2, 1, 9, 8, 7, 6, 23, 22, 12, 11, 37, 36, 62, 61, 87, 86, 112, 111, 236, 361, 486, 611, 736, 861, 986, 1111, 1236, 2486, 3736, 4986, 6236, 7486, 8736, 9986, 11236, 12486, 24986, 37486, 49986, 62486, 74986, 87486, 99986, 112486, 124986]