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.

A075529 Let x(0),...,x(n), be an additive chain of length n+1 with x(0)=1 and satisfying x(k) = x(k-1) + x(j) for some j < k. a(n) is the number of distinct possible values taken on by x(n).

Table of values

n a(n)
0 1
1 1
2 2
3 4
4 8
5 16
6 30
7 55
8 98
9 175
10 310
11 555
12 986
13 1757
14 3138
15 5618

List of values

[1, 1, 2, 4, 8, 16, 30, 55, 98, 175, 310, 555, 986, 1757, 3138, 5618]

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

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