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.

A242509 Number of n-length words on {1,2,3,4,5} that contain at most one consecutive 1 and at most two consecutive 2's and at most three consecutive 3's and at most four consecutive 4's and at most five consecutive 5's.

Table of values

n a(n)
0 1
1 5
2 24
3 115
4 550
5 2631
6 12584
7 60191
8 287901
9 1377066
10 6586677
11 31504891
12 150691790
13 720777469
14 3447567781
15 16490143094
16 78874393932
17 377265981421
18 1804509849677
19 8631193794141
20 41284067429916
21 197466800561799
22 944508129929499
23 4517699202928696

List of values

[1, 5, 24, 115, 550, 2631, 12584, 60191, 287901, 1377066, 6586677, 31504891, 150691790, 720777469, 3447567781, 16490143094, 78874393932, 377265981421, 1804509849677, 8631193794141, 41284067429916, 197466800561799, 944508129929499, 4517699202928696]