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.

A200661 Number of 0..1 arrays x(0..n-1) of n elements with each no smaller than the sum of its three previous neighbors modulo 2.

Table of values

n a(n)
1 2
2 3
3 5
4 8
5 12
6 17
7 25
8 36
9 51
10 72
11 102
12 144
13 202
14 284
15 399
16 560
17 785
18 1101
19 1544
20 2164
21 3033
22 4251
23 5958
24 8349
25 11700
26 16396
27 22976
28 32196
29 45116
30 63221
31 88590
32 124139
33 173953
34 243756
35 341568
36 478629
37 670689
38 939816
39 1316935
40 1845380
41 2585874

List of values

[2, 3, 5, 8, 12, 17, 25, 36, 51, 72, 102, 144, 202, 284, 399, 560, 785, 1101, 1544, 2164, 3033, 4251, 5958, 8349, 11700, 16396, 22976, 32196, 45116, 63221, 88590, 124139, 173953, 243756, 341568, 478629, 670689, 939816, 1316935, 1845380, 2585874]

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

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