cp's OEIS Frontend

A143629 Define E(n) = Sum_{k>=0} (-1)^floor(k/3)*k^n/k! for n = 0,1,2,... . Then E(n) is an integral linear combination of E(0), E(1) and E(2). This sequence lists the coefficients of E(1).

%I A143629 #13 Oct 20 2017 17:09:39
%S A143629 0,1,0,-2,-7,-23,-80,-271,-750,-647,13039,152011,1232583,8750796,
%T A143629 57405464,349329354,1899818951,8008845556,5981853002,-425732481925,
%U A143629 -7285403175563,-89895756043392,-970910901819211,-9663021449412616
%N A143629 Define E(n) = Sum_{k>=0} (-1)^floor(k/3)*k^n/k! for n = 0,1,2,... . Then E(n) is an integral linear combination of E(0), E(1) and E(2). This sequence lists the coefficients of E(1).
%C A143629 This sequence and its companion sequences A143628 and A143630 may be viewed as generalizations of the Uppuluri-Carpenter numbers (complementary Bell numbers) A000587. Define E(n) = Sum_{k>=0} (-1)^floor(k/3)*k^n/k! = 0^n/0! + 1^n/1! + 2^n/2! - 3^n/3! - 4^n/4! - 5^n/5! + + + - - - ... for n = 0,1,2,... . It is easy to see that E(n+3) = 3*E(n+2) - 2*E(n+1) - Sum_{i = 0..n} 3^i*binomial(n,i)*E(n-i) for n >= 0. Thus E(n) is an integral linear combination of E(0), E(1) and E(2). This sequence lists the coefficients of E(1). Some examples are given below. The precise result for E(n) as a linear combination of E(0), E(1) and E(2) is E(n) = A143628(n)*E(0) + A143629(n)*E(1) + A143630(n)*E(2). Compare with A121867 and A143815.
%F A143629 Define three sequences A(n), B(n) and C(n) by the relations: A(n+1) = - Sum_{i = 0..n} binomial(n,i)*C(i), B(n+1) = Sum_{i = 0..n} binomial(n,i)*A(i), C(n+1) = Sum_{i = 0..n} binomial(n,i)*B(i), with initial conditions A(0) = 1, B(0) = C(0) = 0. Then a(n) = B(n) - C(n). The other sequences are A(n) = A143628(n) and C(n) = A143630(n). The values of B(n) are recorded in A143631. Compare with A143818. Also a(n) = A143628(n) - A000587(n).
%e A143629 E(n) as linear combination of E(i),
%e A143629 i = 0..2.
%e A143629 ====================================
%e A143629 ..E(n)..|.....E(0).....E(1)....E(2).
%e A143629 ====================================
%e A143629 ..E(3)..|......-1......-2........3..
%e A143629 ..E(4)..|......-6......-7........7..
%e A143629 ..E(5)..|.....-25.....-23.......14..
%e A143629 ..E(6)..|.....-89.....-80.......16..
%e A143629 ..E(7)..|....-280....-271......-77..
%e A143629 ..E(8)..|....-700....-750.....-922..
%e A143629 ..E(9)..|....-380....-647....-6660..
%e A143629 ..E(10).|...13452...13039...-41264..
%e A143629 ...
%e A143629 a(5) = -23 because E(5) = -25*E(0) - 23*E(1) + 14*E(2).
%e A143629 a(6) = -80 because E(6) = -89*E(0) - 80*E(1) + 16*E(2).
%p A143629 # Compare with A143818
%p A143629 M:=24: a:=array(0..100): b:=array(0..100): c:=array(0..100):
%p A143629 a[0]:=1: b[0]:=0: c[0]:=0:
%p A143629 for n from 1 to M do
%p A143629 a[n]:= -add(binomial(n-1,k)*c[k], k=0..n-1);
%p A143629 b[n]:= add(binomial(n-1,k)*a[k], k=0..n-1);
%p A143629 c[n]:= add(binomial(n-1,k)*b[k], k=0..n-1);
%p A143629 end do:
%p A143629 A143629:=[seq(b[n]-c[n], n=0..M)];
%t A143629 m = 23; a[0] = 1; b[0] = 0; c[0] = 0; For[n = 1, n <= m, n++, a[n] = -Sum[ Binomial[n - 1, k]*c[k], {k, 0, n - 1}]; b[n] = Sum[ Binomial[n - 1, k]*a[k], {k, 0, n - 1}]; c[n] = Sum[ Binomial[n - 1, k]*b[k], {k, 0, n - 1}] ]; A143629 = Table[b[n] - c[n], {n, 0, m}] (* _Jean-François Alcover_, Mar 06 2013, after Maple *)
%Y A143629 A000587, A121867, A143628, A143630, A143631, A143815, A143816, A143817, A143818.
%K A143629 easy,sign
%O A143629 0,4
%A A143629 _Peter Bala_, Sep 05 2008