%I #34 Jun 12 2022 12:01:07
%S 1,2,5,14,42,143,555,2485,12649,72463,461207,3229622,24671899,
%T 204185616,1819837153,17378165240,177012514388,1915724368181,
%U 21952583954117,265533531724484,3380877926676504,45199008472762756
%N Boustrophedon transform of partition numbers.
%H John Cerkan, <a href="/A000751/b000751.txt">Table of n, a(n) for n = 0..482</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 (1996) 44-54 (<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 N. J. A. Sloane, <a href="/transforms.txt">Transforms</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)*A000041(k). - _Reinhard Zumkeller_, Nov 03 2013
%e The array begins:
%e 1
%e 1 -> 2
%e 5 <- 4 <- 2
%e 3 -> 8 -> 12 -> 14
%e 42 <- 39 <- 31 <- 19 <- 5
%e - _John Cerkan_, Jan 26 2017
%t t[n_, 0] := PartitionsP[n]; t[n_, k_] := t[n, k] = t[n, k - 1] + t[n - 1, n - k]; a[n_] := t[n, n]; Array[a, 30, 0] (* _Jean-François Alcover_, Feb 12 2016 *)
%o (Haskell)
%o a000751 n = sum $ zipWith (*) (a109449_row n) a000041_list
%o -- _Reinhard Zumkeller_, Nov 03 2013
%o (Python)
%o from itertools import accumulate, count, islice
%o from sympy import npartitions
%o def A000751_gen(): # generator of terms
%o blist = tuple()
%o for i in count(0):
%o yield (blist := tuple(accumulate(reversed(blist),initial=npartitions(i))))[-1]
%o A000751_list = list(islice(A000751_gen(),40)) # _Chai Wah Wu_, Jun 12 2022
%Y Cf. A000733, A230957.
%K nonn
%O 0,2
%A _N. J. A. Sloane_