|
|
A282715
|
|
Number of nonzero entries in row n of the base-3 generalized Pascal triangle P_3.
|
|
3
|
|
|
1, 2, 2, 3, 3, 4, 3, 4, 3, 4, 5, 6, 5, 4, 6, 7, 7, 6, 4, 6, 5, 7, 6, 7, 5, 6, 4, 5, 7, 8, 8, 7, 10, 10, 11, 9, 7, 8, 10, 7, 5, 8, 11, 10, 9, 10, 13, 12, 13, 10, 12, 11, 11, 8, 5, 8, 7, 10, 9, 11, 8, 10, 7, 10, 12, 13, 11, 8, 11, 13, 12, 10, 7, 10, 8, 11, 9, 10
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
It would be nice to have an entry for the triangle P_3 itself (compare A282714 which gives the base-2 triangle P_2).
|
|
LINKS
|
|
|
FORMULA
|
Leroy et al. (2017) state some conjectured recurrences.
|
|
EXAMPLE
|
The number of nonzero entries in the n-th row of the following triangle:
1
1 1
1 0 1
1 1 0 1
1 2 0 0 1
1 1 1 0 0 1
1 0 1 0 0 0 1
1 1 1 0 0 0 0 1
1 0 2 0 0 0 0 0 1
1 1 0 2 0 0 0 0 0 1
1 2 0 1 1 0 0 0 0 0 1
1 1 1 1 0 1 0 0 0 0 0 1
1 2 0 2 1 0 0 0 0 0 0 0 1
1 3 0 0 3 0 0 0 0 0 0 0 0 1
|
|
MAPLE
|
add(min(P(n, k, 3), 1), k=0..n) ;
end proc:
|
|
MATHEMATICA
|
row[n_] := Module[{bb, ss}, bb = Table[IntegerDigits[k, 3], {k, 0, n}]; ss = Subsets[Last[bb]]; Prepend[Count[ss, #]& /@ bb // Rest, 1]];
a[n_] := Count[row[n], _?Positive];
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|