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.

A360695 Total number of sets of k words of length k over binary alphabet with exactly n occurrences of the first letter in the set, summed over all k >= 0.

Table of values

n a(n)
0 2
1 3
2 5
3 16
4 57
5 230
6 1071
7 5429
8 29810
9 175718
10 1101090
11 7294593
12 50829712
13 370975443
14 2826022446
15 22403032310
16 184339146428
17 1570830751662
18 13835026646912
19 125719891784479
20 1176838995406439
21 11331919317891519
22 112100167281082176
23 1137938904082103310

List of values

[2, 3, 5, 16, 57, 230, 1071, 5429, 29810, 175718, 1101090, 7294593, 50829712, 370975443, 2826022446, 22403032310, 184339146428, 1570830751662, 13835026646912, 125719891784479, 1176838995406439, 11331919317891519, 112100167281082176, 1137938904082103310]

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

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