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.

A316403 Number of multisets of exactly two nonempty binary words with a total of n letters such that no word has a majority of 0's.

Table of values

n a(n)
2 1
3 3
4 10
5 23
6 59
7 134
8 320
9 699
10 1599
11 3434
12 7682
13 16246
14 35762
15 74892
16 163032
17 338771
18 731051
19 1510466
20 3237206
21 6658530
22 14189790
23 29083988
24 61687496
25 126076638
26 266332390
27 543061284
28 1143207236
29 2326521164
30 4882706596
31 9920514328
32 20764519984
33 42130081155

List of values

[1, 3, 10, 23, 59, 134, 320, 699, 1599, 3434, 7682, 16246, 35762, 74892, 163032, 338771, 731051, 1510466, 3237206, 6658530, 14189790, 29083988, 61687496, 126076638, 266332390, 543061284, 1143207236, 2326521164, 4882706596, 9920514328, 20764519984, 42130081155]

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

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