1,1

Pascal-like triangle with index of asymmetry (y=1) and index of

obliqueness (z=0) read by rows with recurence G(n, k): G(n, 0)=G(n+1,

n+1)=1, G(n+2,

n+1)=2, G(n+3, k)=G(n+1, k-1)+G(n+1, k)+G(n+2, k) for k:=1..(n+1).

Pascal-like triangle with index of asymmetry(y=1) and index of obliqueness

(z=1) read by rows with recurence G(n, k): G(n, n)=G(n+1, 0)=1, G(n+2,

1)=2, G(n+3, k)=G(n+1,

k-1)+G(n+1, k-2)+G(n+2, k-1) for k=2..(n+2).

Juri-Stepan Gerasimov, Stepan's triangles and Pascal's triangle are connected by the recurrence relation ...

Pascal-like triangle (y=1, z=0) begins:

If 1

1 1

1 2 1, then a(1)=2.

If 1 4 2 1

1 7 5 2 1, then a(2)=7.

1 12 11 5 2 1, then a(3)=11.

If 1 20 23 12 5 2 1, then a(4)=23.

If 1 33 46 28 12 5 2 1

1 54 89 63 29 12 5 2 1, then a(5)=29, a(6)=89.

If 1 88 168 137 69 29 12 5 2 1, then a(7)=137.

If 1 143 311 289 161 70 29 12 5 2 1, then a(8)=311.

If 1 232 567 594 367 168 70 29 12 5 2 1, then a(9)=367.

Cf. A140998.

Sequence in context: A038884 A040122 A038955 this_sequence A131102 A039679 A088823

Adjacent sequences: A141061 A141062 A141063 this_sequence A141065 A141066 A141067

nonn,uned

Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), Jul 14 2008

Partially edited by N. J. A. Sloane (njas(AT)research.att.com), Jul 18 2008