A346795 Irregular triangle T(n, k), n > 0, k = 1..A091220(n), read by rows; the n-th row gives, in ascending order, the distinct integers k such that A048720(k, m) = n for some m.
1, 1, 2, 1, 3, 1, 2, 4, 1, 3, 5, 1, 2, 3, 6, 1, 7, 1, 2, 4, 8, 1, 3, 7, 9, 1, 2, 3, 5, 6, 10, 1, 11, 1, 2, 3, 4, 6, 12, 1, 13, 1, 2, 7, 14, 1, 3, 5, 15, 1, 2, 4, 8, 16, 1, 3, 5, 15, 17, 1, 2, 3, 6, 7, 9, 14, 18, 1, 19, 1, 2, 3, 4, 5, 6, 10, 12, 20, 1, 7, 21
Offset: 1
Examples
The triangle starts:
1: [1]
2: [1, 2]
3: [1, 3]
4: [1, 2, 4]
5: [1, 3, 5]
6: [1, 2, 3, 6]
7: [1, 7]
8: [1, 2, 4, 8]
9: [1, 3, 7, 9]
10: [1, 2, 3, 5, 6, 10]
11: [1, 11]
12: [1, 2, 3, 4, 6, 12]
13: [1, 13]
14: [1, 2, 7, 14]
15: [1, 3, 5, 15]
Links
- Rémy Sigrist, Table of n, a(n) for n = 1..9228 (first 1024 rows flattened)
- Rémy Sigrist, PARI program for A346795
- Index entries for sequences operating on GF(2)[X]-polynomials
Programs
-
PARI
See Links section.
Comments