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.

A326845 Sum times maximum of the integer partition with Heinz number n.

Table of values

n a(n)
1 0
2 1
3 4
4 2
5 9
6 6
7 16
8 3
9 8
10 12
11 25
12 8
13 36
14 20
15 15
16 4
17 49
18 10
19 64
20 15
21 24
22 30
23 81
24 10
25 18
26 42
27 12
28 24
29 100
30 18
31 121
32 5
33 35
34 56
35 28
36 12
37 144
38 72
39 48
40 18
41 169
42 28
43 196
44 35
45 21
46 90
47 225
48 12
49 32
50 21
51 63
52 48
53 256
54 14
55 40
56 28
57 80
58 110
59 289
60 21
61 324
62 132
63 32
64 6
65 54
66 40

List of values

[0, 1, 4, 2, 9, 6, 16, 3, 8, 12, 25, 8, 36, 20, 15, 4, 49, 10, 64, 15, 24, 30, 81, 10, 18, 42, 12, 24, 100, 18, 121, 5, 35, 56, 28, 12, 144, 72, 48, 18, 169, 28, 196, 35, 21, 90, 225, 12, 32, 21, 63, 48, 256, 14, 40, 28, 80, 110, 289, 21, 324, 132, 32, 6, 54, 40]

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

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