login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A309462 Limiting row sequence for Pascal-like triangle A140995 (Stepan's triangle with index of asymmetry s = 3). 2

%I #19 Aug 04 2019 20:02:14

%S 1,2,4,8,17,35,72,149,308,636,1314,2715,5609,11588,23941,49462,102188,

%T 211120,436173,901131,1861732,3846329,7946496,16417420,33918306,

%U 70075047,144774689,299103768,617946857,1276675050,2637604132,5449276664,11258177753,23259337731

%N Limiting row sequence for Pascal-like triangle A140995 (Stepan's triangle with index of asymmetry s = 3).

%C In the attached photograph, we see that the index of asymmetry is denoted by s and the index of obliqueness by e. The general recurrence is G(n+s+2, k) = G(n+1, k-e*s+e-1) + Sum_{1 <= m <= s+1} G(n+m, k-e*s+m*e-2*e) for n >= 0 with k = 1..(n+1) when e = 0 and k = (s+1)..(n+s+1) when e = 1. The initial conditions are G(n+x+1, n-e*n+e*x-e+1) = 2^x for x=0..s and n >= 0. There is one more initial condition, namely, G(n, e*n) = 1 for n >= 0.

%C For s = 0, we get Pascal's triangle A007318. For s = 1, we get A140998 (e = 0) and A140993 (e = 1). For s = 2, we get A140997 (e = 0) and A140994 (e = 1). For s = 3, we get A140996 (e = 0) and A140995 (e = 1). For s = 4, we have arrays A141020 (with e = 0) and A141021 (with e = 1). In some of these arrays, the indices n and k are shifted.

%C For the triangular array G(n, k) = A140995(n, k), we have G(n, n) = G(n+1, 0) = 1, G(n+2, 1) = 2, G(n+3, 2) = 4, G(n+4, 3) = 8, and G(n+5, k) = G(n+1, k-3) + G(n+1, k-4) + G(n+2, k-3) + G(n+3, k-2) + G(n+4, k-1) for n >= 0 and k = 4..(n+4).

%C With G(n, k) = A140995(n, k), the current sequence (a(k): k >= 0) is defined by a(k) = lim_{n -> infinity} G(n, k) for k >= 0. Then a(k) = a(k-4) + 2*a(k-3) + a(k-2) + a(k-1) for k >= 4 with a(x) = 2^x for x = 0..3.

%H Juri-Stepan Gerasimov, <a href="/A140998/a140998.jpg">Stepan's triangles and Pascal's triangle are connected by the recurrence relation ...</a>

%F a(0) = 1, a(1) = 2, a(2) = 4, a(3) = 8, and a(k) = a(k-1) + a(k-2) + 2*a(k-3) + a(k-4) for k >= 4.

%F G.f.: (x^2 + x + 1)/(-x^4 - 2*x^3 - x^2 - x + 1).

%Y Cf. A007318, A140993, A140994, A140995, A140996, A140997, A140998, A141020, A141021, A141031, A141065, A141066, A141067, A141068, A141069, A141070, A141072, A141073, A308808.

%K nonn,easy

%O 0,2

%A _Petros Hadjicostas_, Aug 03 2019

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)