Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
A355802
A variant of Pascal's triangle (A007318) where new rows are added cyclically below, to the right and to the left.
2
1, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 2, 2, 2, 1, 1, 2, 3, 3, 2, 1, 1, 2, 3, 4, 3, 2, 1, 1, 2, 3, 4, 4, 3, 2, 1, 1, 2, 3, 5, 6, 5, 3, 2, 1, 1, 2, 3, 5, 7, 7, 5, 3, 2, 1, 1, 2, 3, 5, 7, 8, 7, 5, 3, 2, 1, 1, 2, 3, 5, 8, 11, 11, 8, 5, 3, 2, 1, 1, 2, 3, 5, 8, 12, 14, 12, 8, 5, 3, 2, 1
OFFSET
0,5
COMMENTS
The procedure to build the present triangle is as follows:
- row 0 contains a single 1:
. 1
- row 1 is added below, each new term is the sum of the adjacent prior terms:
. 1
. ---
. 1 1
- row 2 is added to the right, each new term is the sum of the adjacent prior terms:
. 1
. \
. 1 \ 2
. \
. 1 1 \ 1
- row 3 is added to the left, each new term is the sum of the adjacent prior terms:
. 1
. /
. 2 / 1
. /
. 2 / 1 2
. /
. 1 / 1 1 1
- row 4 is added below, each new term is the sum of the adjacent prior terms:
. 1
.
. 2 1
.
. 2 1 2
.
. 1 1 1 1
. ---------------
. 1 2 2 2 1
- and so on.
FORMULA
T(n, 0) = T(n, n) = 1.
T(n, k) = T(n, n-k).
EXAMPLE
Triangle begins:
1;
1, 1;
1, 2, 1;
1, 2, 2, 1;
1, 2, 2, 2, 1;
1, 2, 3, 3, 2, 1;
1, 2, 3, 4, 3, 2, 1;
1, 2, 3, 4, 4, 3, 2, 1;
1, 2, 3, 5, 6, 5, 3, 2, 1;
1, 2, 3, 5, 7, 7, 5, 3, 2, 1;
1, 2, 3, 5, 7, 8, 7, 5, 3, 2, 1;
1, 2, 3, 5, 8, 11, 11, 8, 5, 3, 2, 1;
1, 2, 3, 5, 8, 12, 14, 12, 8, 5, 3, 2, 1;
...
PROG
(PARI) See Links section.
CROSSREFS
Sequence in context: A348042 A143209 A163994 * A156593 A206498 A184848
KEYWORD
nonn,tabl
AUTHOR
Rémy Sigrist, Jul 17 2022
STATUS
approved