login
Boustrophedon transform of even numbers.
4

%I #18 Jun 12 2022 10:19:53

%S 0,2,8,24,72,240,924,4116,20944,119952,763540,5346748,40845816,

%T 338041704,3012855356,28770647220,293055401888,3171602665696,

%U 36343889387172,439607533130732,5597256953340360,74829813397495128,1048039052970587788,15345654816688856484

%N Boustrophedon transform of even numbers.

%H Reinhard Zumkeller, <a href="/A231200/b231200.txt">Table of n, a(n) for n = 0..400</a>

%H Peter Luschny, <a href="http://oeis.org/wiki/User:Peter_Luschny/SeidelTransform">An old operation on sequences: the Seidel transform</a>

%H J. Millar, N. J. A. Sloane and N. E. Young, A new operation on sequences: the Boustrophedon transform, J. Combin. Theory, 17A 44-54 1996 (<a href="http://neilsloane.com/doc/bous.txt">Abstract</a>, <a href="http://neilsloane.com/doc/bous.pdf">pdf</a>, <a href="http://neilsloane.com/doc/bous.ps">ps</a>).

%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Boustrophedon_transform">Boustrophedon_transform</a>

%H <a href="/index/Bo#boustrophedon">Index entries for sequences related to boustrophedon transform</a>

%F a(n) = Sum_{k=0..n} A109449(n,k)*k*2.

%F a(n) = 2*A231179(n).

%F E.g.f.: 2*x*exp(x)*(sec(x) + tan(x)). - _Ilya Gutkovskiy_, Sep 27 2017

%t T[n_, k_] := SeriesCoefficient[(1+Sin[x])/Cos[x], {x, 0, n-k}] n!/k!;

%t a[n_] := 2 Sum[k T[n, k], {k, 0, n}];

%t Table[a[n], {n, 0, 23}] (* _Jean-François Alcover_, Jun 28 2019 *)

%o (Haskell)

%o a231200 n = sum $ zipWith (*) (a109449_row n) $ [0, 2 ..]

%o (Python)

%o from itertools import accumulate, count, islice

%o def A231200_gen(): # generator of terms

%o blist = tuple()

%o for i in count(0,2):

%o yield (blist := tuple(accumulate(reversed(blist),initial=i)))[-1]

%o A231200_list = list(islice(A231200_gen(),40)) # _Chai Wah Wu_, Jun 12 2022

%Y Cf. A005843, A000754.

%K nonn

%O 0,2

%A _Reinhard Zumkeller_, Nov 05 2013