|
|
A000718
|
|
Boustrophedon transform of triangular numbers 1,1,3,6,10,...
|
|
5
|
|
|
1, 2, 6, 20, 65, 226, 883, 3947, 20089, 115036, 732171, 5126901, 39165917, 324138010, 2888934623, 27587288507, 281001801969, 3041152133848, 34849036364659, 421526126267265, 5367037330561365, 71752003756908550
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
LINKS
|
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 (Abstract, pdf, ps).
|
|
FORMULA
|
a(n) ~ n! * (8 + exp(Pi/2)*Pi*(4+Pi)) * 2^(n-1) / Pi^(n+1). - Vaclav Kotesovec, Jun 12 2015
|
|
MATHEMATICA
|
t[n_, 0] := If[n == 0, 1, n*(n+1)/2]; 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 *)
|
|
PROG
|
(Haskell)
a000718 n = sum $ zipWith (*) (a109449_row n) (1 : tail a000217_list)
(Python)
from itertools import accumulate, count, islice
def A000718_gen(): # generator of terms
yield 1
blist, c = (1, ), 1
for i in count(2):
yield (blist := tuple(accumulate(reversed(blist), initial=c)))[-1]
c += i
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|