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.

A227961 Triangle T(n,k) read by rows: how often does k appear among the first A006116(n) entries of A198260?

Original entry on oeis.org

2, 3, 2, 4, 8, 2, 2, 5, 22, 8, 24, 2, 2, 2, 2, 6, 52, 22, 150, 8, 24, 24, 72, 2, 2, 2, 2, 2, 2, 2, 2, 7, 114, 52, 740, 22, 150, 150, 1046, 8, 24, 24, 72, 24, 72, 72, 216, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 8, 240, 114, 3282, 52, 740
Offset: 1

Views

Author

Tilman Piesk, Aug 01 2013

Keywords

Comments

T(n,k) shows how often k appears among the first A006116(n) entries of A198260.
n and k are counted from 1:
2,
3, 2,
4, 8, 2, 2,
5, 22, 8, 24, 2, 2, 2, 2,
6, 52,22,150, 8, 24, 24, 72,2, 2, 2, 2, 2, 2, 2, 2,
7,114,52,740,22,150,150,1046,8,24,24,72,24,72,72,216,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2
The number of different entries per row is 1,2,3,5,8,12,16...
The second column 2,8,22,52,114,240... seems to appear in other columns as well.
Row lengths are powers of two (A000079).
Row sums are the sums of Gaussian binomial coefficients (A006116).