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.

A387012 Number of ternary strings of length 2*n that have fewer 0's than the combined number of 1's and 2's.

Table of values

n a(n)
0 0
1 4
2 48
3 496
4 4864
5 46464
6 436992
7 4068096
8 37601280
9 345733120
10 3166363648
11 28910051328
12 263320698880
13 2393742770176
14 21726260035584
15 196938517118976
16 1783247797223424
17 16132649384411136
18 145839570932465664
19 1317564543167102976
20 11896996193604993024
21 107375816824319901696

List of values

[0, 4, 48, 496, 4864, 46464, 436992, 4068096, 37601280, 345733120, 3166363648, 28910051328, 263320698880, 2393742770176, 21726260035584, 196938517118976, 1783247797223424, 16132649384411136, 145839570932465664, 1317564543167102976, 11896996193604993024, 107375816824319901696]

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

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