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.

A057338 Occurrences of most frequently occurring number in 1-to-n multiplication cube.

Table of values

n a(n)
1 1
2 3
3 6
4 9
5 9
6 15
7 15
8 21
9 24
10 24
11 24
12 36
13 36
14 36
15 48
16 51
17 51
18 57
19 57
20 75
21 75
22 75
23 75
24 90
25 90
26 90
27 90
28 90
29 90
30 114
31 114
32 114
33 114
34 114
35 126
36 138
37 138
38 138
39 138
40 156
41 156
42 180
43 180
44 180
45 198
46 198
47 198
48 207
49 207
50 207
51 207
52 207
53 207
54 207
55 207
56 237
57 237
58 237
59 237
60 267

List of values

[1, 3, 6, 9, 9, 15, 15, 21, 24, 24, 24, 36, 36, 36, 48, 51, 51, 57, 57, 75, 75, 75, 75, 90, 90, 90, 90, 90, 90, 114, 114, 114, 114, 114, 126, 138, 138, 138, 138, 156, 156, 180, 180, 180, 198, 198, 198, 207, 207, 207, 207, 207, 207, 207, 207, 237, 237, 237, 237, 267]

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

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