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.

A274328 a(n) is the sum of a sequence of multiples of the n-th prime such that it contains each of the digits from 0 to 9 exactly once and with the least sum possible, or 0 if there is no satisfying sequence.

Table of values

n a(n)
1 270
2 135
3 38475
4 252
5 1881
6 702
7 918
8 684
9 1656
10 2349
11 1953
12 7326
13 2952
14 2322
15 2961
16 3339
17 3717
18 3843
19 3015
20 3195
21 3285
22 5688
23 8217
24 5607
25 4365
26 95445
27 6489
28 4815
29 3924
30 37629
31 35433
32 10611
33 9864
34 5004
35 41571
36 4077
37 39564
38 2934
39 34569
40 42039

List of values

[270, 135, 38475, 252, 1881, 702, 918, 684, 1656, 2349, 1953, 7326, 2952, 2322, 2961, 3339, 3717, 3843, 3015, 3195, 3285, 5688, 8217, 5607, 4365, 95445, 6489, 4815, 3924, 37629, 35433, 10611, 9864, 5004, 41571, 4077, 39564, 2934, 34569, 42039]