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.

A128094 Number of sequences s of length n, with s[1]=1, s[2]=1, s[3]=1, s[k-1] <=s[k] <= s[k-1]+s[k-2]+s[k-3] (s is called a sub-tribonacci sequence of length n).

Table of values

n a(n)
3 1
4 3
5 9
6 36
7 228
8 2196
9 33901
10 862503
11 36346723
12 2564238411
13 304902857694
14 61384367733677
15 21020435566780278
16 12292402317454051941
17 12319906894146608845054
18 21234027294331775378957366

List of values

[1, 3, 9, 36, 228, 2196, 33901, 862503, 36346723, 2564238411, 304902857694, 61384367733677, 21020435566780278, 12292402317454051941, 12319906894146608845054, 21234027294331775378957366]