|
Search: id:A129765
|
|
|
| A129765 |
|
Triangle, (1, 1, 2, 2, 2,...) in every column. |
|
+0
2
|
|
| 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 2, 2, 2, 1, 1, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
COMMENT
|
Row sums = A004277, (1, 2, 4, 6, 8, 10,...). Binomial transform of (1, 1, 2, 2, 2...) = A000325, starting (1, 2, 5, 12, 27, 58,...). Binomial transform of A130196 = A130197, a triangle with row sums = the Cullen numbers, A002064.
|
|
FORMULA
|
Triangle, (1, 1, 2, 2, 2,...) in every column. By rows, (1; 1, 1; 2, 1, 1;...), continuing with (n-2) 2's followed by two 1's. Inverse of A000012 as an infinite lower triangular matrix (all 1's and the rest zeros), signed by columns: (+ - - + + - -,...).
|
|
EXAMPLE
|
First few rows of the triangle are:
1;
1, 1;
2, 1, 1;
2, 2, 1, 1;
2, 2, 2, 1, 1;
...
|
|
MAPLE
|
A129765 := proc(n, m) if abs(n-m)<2 then 1 ; else 2 ; fi ; end: for n from 1 to 18 do for m from 1 to n do printf("%d, ", A129765(n, m)) ; od ; od ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jun 08 2007
|
|
CROSSREFS
|
Cf. A004277, A002064, A000325, A130197.
Sequence in context: A134034 A157415 A154325 this_sequence A143187 A143209 A163994
Adjacent sequences: A129762 A129763 A129764 this_sequence A129766 A129767 A129768
|
|
KEYWORD
|
nonn,tabl,easy
|
|
AUTHOR
|
Gary W. Adamson (qntmpkt(AT)yahoo.com), May 16 2007
|
|
EXTENSIONS
|
More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jun 08 2007
|
|
|
Search completed in 0.002 seconds
|
