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.

A144416 a(n) is the total number of partitions of [1, 2, ..., k] into exactly n blocks, each of size 1, 2 or 3, for 0 <= k <= 3n.

Table of values

n a(n)
0 1
1 3
2 31
3 842
4 45296
5 4061871
6 546809243
7 103123135501
8 25942945219747
9 8394104851717686
10 3395846808758759686
11 1679398297627675722593
12 996789456118195908366641
13 699283226713639676370419067
14 572385833490097906671186099971
15 540635257271794961275858251107746
16 583630397618757664934692641037584628

List of values

[1, 3, 31, 842, 45296, 4061871, 546809243, 103123135501, 25942945219747, 8394104851717686, 3395846808758759686, 1679398297627675722593, 996789456118195908366641, 699283226713639676370419067, 572385833490097906671186099971, 540635257271794961275858251107746, 583630397618757664934692641037584628]

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

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