|
Search: id:A144379
|
|
| |
|
| 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 2, 2, 4, 1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 4, 2, 6, 1, 1, 1, 2, 2, 2, 3, 4, 1, 1, 2, 1, 3, 2, 4, 3, 6, 1, 1, 1, 2, 2, 1, 2, 3, 2, 4, 1, 1, 2, 2, 4, 2, 6, 4, 6, 4, 10, 1, 1, 1, 1, 1, 2, 2, 3, 3, 2, 3, 4, 1, 1, 2, 2, 4, 2, 6, 4, 6, 4, 10, 4, 12, 1, 1, 1, 2, 2, 2, 3, 3, 2, 3, 4, 3, 5
(list; table; graph; listen)
|
|
|
OFFSET
|
1,6
|
|
|
COMMENT
|
Right border = phi(n): (1, 1, 2, 2, 4, 2, 6, 4, 6, 4, 10,...).
Row sums = A125728: (1, 2, 4, 5, 10, 7, 18, 16, 23,...) = the number of positive integers less <=k coprime to both k and n.
|
|
FORMULA
|
Given A054521 as an infinite lower triangular matrix, perform A054521(transform). Multiply the result by A054521 getting an array, then extract the first n terms of each row to form a new triangle.
|
|
EXAMPLE
|
A054521 * A054521(transform) =
1, 1, 1, 1, 1, 1, 1,...
1, 1, 1, 1, 1, 1, 1,...
1, 1, 2, 1, 2, 1, 2,...
1, 1, 1, 2, 2, 1, 2,...
1, 1, 2, 2, 4, 1, 4,...
...
Then extract the lower half of the array including the diagonal, A000010, phi(n); getting triangle A144379:
1;
1, 1;
1, 1, 2
1, 1, 1, 2;
1, 1, 2, 2, 4;
1, 1, 1, 1, 1, 2;
1, 1, 2, 2, 4, 2, 6;
1, 1, 1, 2, 2, 2, 3, 4;
1, 1, 2, 1, 3, 2, 4, 3, 6;
1, 1, 1, 2, 2, 1, 2, 3, 2, 4;
1, 1, 2, 2, 4, 2, 6, 4, 6, 4, 10;
...
|
|
CROSSREFS
|
A054521, Cf. A000010, A125728
Sequence in context: A029444 A122191 A097847 this_sequence A107435 A161095 A118107
Adjacent sequences: A144376 A144377 A144378 this_sequence A144380 A144381 A144382
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Gary W. Adamson (qntmpkt(AT)yahoo.com), Sep 19 2008
|
|
|
Search completed in 0.002 seconds
|
