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.

A079662 a(n) = the number of occurrences of 1 in all compositions of n without 2's = # of occurrences of the integer k in compositions of n+k-1 without 2's (k > 2).

Table of values

n a(n)
1 1
2 2
3 3
4 6
5 13
6 26
7 50
8 96
9 184
10 350
11 661
12 1242
13 2324
14 4332
15 8047
16 14902
17 27521
18 50700
19 93191
20 170942
21 312974
22 572030
23 1043852
24 1902044
25 3461067
26 6289972
27 11417576
28 20702328
29 37498589
30 67856074
31 122677727
32 221599538
33 399962369
34 721333090

List of values

[1, 2, 3, 6, 13, 26, 50, 96, 184, 350, 661, 1242, 2324, 4332, 8047, 14902, 27521, 50700, 93191, 170942, 312974, 572030, 1043852, 1902044, 3461067, 6289972, 11417576, 20702328, 37498589, 67856074, 122677727, 221599538, 399962369, 721333090]