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!)
A117440 A cyclically signed version of Pascal's triangle. 4
1, 1, 1, -1, 2, 1, -1, -3, 3, 1, 1, -4, -6, 4, 1, 1, 5, -10, -10, 5, 1, -1, 6, 15, -20, -15, 6, 1, -1, -7, 21, 35, -35, -21, 7, 1, 1, -8, -28, 56, 70, -56, -28, 8, 1, 1, 9, -36, -84, 126, 126, -84, -36, 9, 1, -1, 10, 45, -120, -210, 252, 210, -120, -45, 10, 1 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
0,5
LINKS
FORMULA
Column k has e.g.f.: (x^k/k!)*(cos(x) + sin(x)).
T(n, k) = binomial(n,k)*(cos(Pi*(n-k)/2) + sin(Pi*(n-k)/2).
Sum_{k=0..n} T(n, k) = A009545(n+1).
Sum_{k=0..floor(n/2)} T(n-k, k) = A117441(n) (upward diagonal sums).
G.f.: (1 + x - x*y)/(1 - 2*x*y + x^2*(1 + y^2)). - Stefano Spezia, Mar 10 2024
EXAMPLE
Triangle begins:
1;
1, 1;
-1, 2, 1;
-1, -3, 3, 1;
1, -4, -6, 4, 1;
1, 5, -10, -10, 5, 1;
-1, 6, 15, -20, -15, 6, 1;
-1, -7, 21, 35, -35, -21, 7, 1;
MATHEMATICA
Table[Binomial[n, k]*(Cos[Pi*(n-k)/2] +Sin[Pi*(n-k)/2]), {n, 0, 12}, {k, 0, n}]//Flatten (* G. C. Greubel, Jun 01 2021 *)
PROG
(Sage) flatten([[binomial(n, k)*( cos(pi*(n-k)/2) + sin(pi*(n-k)/2) ) for k in (0..n)] for n in (0..12)]) # G. C. Greubel, Jun 01 2021
CROSSREFS
Cf. A007318, A009545 (row sums), A117441 (diagonal sums), A117442 (inverse).
Sequence in context: A273914 A094495 A154926 * A118433 A007318 A108086
KEYWORD
easy,sign,tabl
AUTHOR
Paul Barry, Mar 16 2006
STATUS
approved

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 20 00:26 EDT 2024. Contains 371798 sequences. (Running on oeis4.)