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.

A300326 Sum of the largest possible permutations that can be written without repetition of digits in each base from binary to n+1.

Table of values

n a(n)
0 0
1 2
2 23
3 251
4 3181
5 47971
6 848638
7 17283462
8 398650506
9 10275193716
10 292733747621
11 9135147415313
12 309906954656231
13 11356162260536389
14 447015900139452604
15 18811774444632517324
16 842820629057975778516
17 40053081963609542635686
18 2012366504118798707101875

List of values

[0, 2, 23, 251, 3181, 47971, 848638, 17283462, 398650506, 10275193716, 292733747621, 9135147415313, 309906954656231, 11356162260536389, 447015900139452604, 18811774444632517324, 842820629057975778516, 40053081963609542635686, 2012366504118798707101875]

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

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