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.

A001641 A Fielder sequence: a(n) = a(n-1) + a(n-2) + a(n-4).

Table of values

n a(n)
1 1
2 3
3 4
4 11
5 16
6 30
7 50
8 91
9 157
10 278
11 485
12 854
13 1496
14 2628
15 4609
16 8091
17 14196
18 24915
19 43720
20 76726
21 134642
22 236283
23 414645
24 727654
25 1276941
26 2240878
27 3932464
28 6900996
29 12110401
30 21252275
31 37295140
32 65448411
33 114853952
34 201554638
35 353703730
36 620706779

List of values

[1, 3, 4, 11, 16, 30, 50, 91, 157, 278, 485, 854, 1496, 2628, 4609, 8091, 14196, 24915, 43720, 76726, 134642, 236283, 414645, 727654, 1276941, 2240878, 3932464, 6900996, 12110401, 21252275, 37295140, 65448411, 114853952, 201554638, 353703730, 620706779]

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

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